Fault-tolerability analysis of hypercubes based on 3-component path-structure connectivity

Συγγραφείς: Bo Zhu, Shumin Zhang, Jou-Ming Chang, Jinyu Zou

Πηγή: Discrete Applied Mathematics. 370:111-123

Θεματικοί όροι: Connectivity, Network design and communication in computer systems, Graph theory (including graph drawing) in computer science, \(r\)-component \(H\)-structure connectivity, Small world graphs, complex networks (graph-theoretic aspects), interconnection network, hypercube

Περιγραφή αρχείου: application/xml

Enumerating Minimal Connected Dominating Sets: Enumerating minimal connected dominating sets

Συγγραφείς: Faisal Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann

Συνεισφορές: Faisal N. Abu-Khzam and Henning Fernau and Benjamin Gras and Mathieu Liedloff and Kevin Mann

Πηγή: SIAM Journal on Discrete Mathematics. 39:946-972

Θεματικοί όροι: connected domination, Connectivity, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), enumeration problems, degenerate graphs, Graph algorithms (graph-theoretic aspects), Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Analysis of algorithms, ddc:004, Enumeration in graph theory, Nonnumerical algorithms

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.1

Decomposition of the option pricing formula for infinite activity jump-diffusion stochastic volatility models

Συγγραφείς: Youssef El-Khatib, Zororo S. Makumbe, Josep Vives

Πηγή: Mathematics and Computers in Simulation. 231:276-293

Θεματικοί όροι: option price decomposition, Lévy processes, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, variance gamma, Computer graphics, computational geometry (digital and algorithmic aspects), tempered stable, stochastic volatility

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8031680
https://doi.org/10.1016/j.matcom.2024.12.010

Twin-Width of Subdivisions of Multigraphs: Twin-width of subdivisions of multigraphs

Συγγραφείς: Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Sang-il Oum

Πηγή: SIAM Journal on Discrete Mathematics. 39:783-833

Θεματικοί όροι: FOS: Computer and information sciences, Extremal problems in graph theory, Distance in graphs, Discrete Mathematics (cs.DM), Discrete Mathematics, Graph minors, twin-width, graph minor, 05C35, 05C75, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Combinatorics, Graph theory (including graph drawing) in computer science, subdivision, FOS: Mathematics, multigraph, Structural characterization of families of graphs, Combinatorics (math.CO)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2306.05334
https://zbmath.org/8037174
https://doi.org/10.1137/23m1621514

Finding 3-Swap-Optimal Independent Sets and Dominating Sets is Hard: Finding 3-swap-optimal independent sets and dominating sets is hard

Συγγραφείς: Christian Komusiewicz, Nils Morawietz

Συνεισφορές: Christian Komusiewicz and Nils Morawietz

Πηγή: ACM Transactions on Computation Theory. 17:1-31

Θεματικοί όροι: vertex deletion problems, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph problems, PLS-completeness, Local Search, Graph theory (including graph drawing) in computer science, local search, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), ddc:004, swap neighborhood, 3-swap neighborhood, Approximation methods and heuristics in mathematical programming

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: https://zbmath.org/8029723
https://doi.org/10.1145/3700642
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.66

The Chromatic Number of Kneser Hypergraphs via Consensus Division: The chromatic number of Kneser hypergraphs via consensus division

Συγγραφείς: Ishay Haviv

Συνεισφορές: Ishay Haviv

Πηγή: ACM Transactions on Computation Theory. 17:1-23

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Computational Complexity (cs.CC), Hypergraphs, consensus division, 01 natural sciences, complexity classes, Computer Science - Computational Complexity, Coloring of graphs and hypergraphs, the complexity classes PPA-p, Graph theory (including graph drawing) in computer science, FOS: Mathematics, Complexity classes (hierarchies, relations among complexity classes, etc.), Mathematics - Combinatorics, Algebraic Topology (math.AT), Mathematics - Algebraic Topology, Combinatorics (math.CO), ddc:004, 0101 mathematics, Kneser hypergraphs, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2311.09016
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.60

The algorithmic phase transition of random graph alignment problem

Συγγραφείς: Du, Hang, Gong, Shuyang, Huang, Rundong

Πηγή: Probability Theory and Related Fields. 191:1233-1288

Θεματικοί όροι: FOS: Computer and information sciences, Combinatorial probability, 60C05, 68R10, 05C80, Probability (math.PR), Random graphs (graph-theoretic aspects), computational hardness, phase transition, efficient algorithm, Graph theory (including graph drawing) in computer science, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Mathematics - Probability, random graph

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2307.06590

Maximum-utility Popular Matchings with Bounded Instability: Maximum-utility popular matchings with bounded instability

Συγγραφείς: Ildikó Schlotter, Ágnes Cseh

Πηγή: ACM Transactions on Computation Theory. 17:1-35

Θεματικοί όροι: FOS: Computer and information sciences, Matching models, Discrete Mathematics (cs.DM), stable matching, 0211 other engineering and technologies, Parameterized complexity, tractability and kernelization, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, popular matching, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), master lists, Data Structures and Algorithms (cs.DS), complexity, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2205.02189

Computing Hamiltonian Paths with Partial Order Restrictions: Computing Hamiltonian paths with partial order restrictions

Συγγραφείς: Jesse Beisegel, Fabienne Ratajczak, Robert Scheffler

Πηγή: ACM Transactions on Computation Theory. 17:1-24

Θεματικοί όροι: FOS: Computer and information sciences, Eulerian and Hamiltonian graphs, Discrete Mathematics (cs.DM), Parameterized complexity, tractability and kernelization, Computational Complexity (cs.CC), outerplanar graph, partial search order, Computer Science - Computational Complexity, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, Hamiltonian path, partial order, FOS: Mathematics, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Paths and cycles, TSP-PC, parameterized complexity, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2404.16662

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set: Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set

Συγγραφείς: Daniel Lokshtanov, Maadapuzhi-Sridharan Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Πηγή: ACM Transactions on Computation Theory. 17:1-28

Θεματικοί όροι: Graph theory (including graph drawing) in computer science, polynomial kernel, treewidth, Parameterized complexity, tractability and kernelization, important separator, directed feedback vertex set

Περιγραφή αρχείου: application/xml

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure: XNLP-completeness for parameterized problems on graphs with a linear structure

Συγγραφείς: Bodlaender, Hans L., Groenland, Carla, Jacob, Hugo, Jaffke, Lars, Lima, Paloma Thome de

Συνεισφορές: Hans L. Bodlaender and Carla Groenland and Hugo Jacob and Lars Jaffke and Paloma T. Lima, Sub Algorithms and Complexity, Sub Mathematical Modeling, Algorithms and Complexity, Dell, Holger, Nederlof, Jesper

Πηγή: Leibniz International Proceedings in Informatics
8:1-8:18
Algorithmica
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
IPEC

Θεματικοί όροι: bandwidth, FOS: Computer and information sciences, XP space requirement, Parameterized complexity, tractability and kernelization, Pathwidth, Linear clique-width, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, 7. Clean energy, Bandwidth, Graph algorithms (graph-theoretic aspects), 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), linear mim-width, parameterized complexity, pathwidth, Parameterized complexity, Computer Science - Computational Complexity, Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), XNLP, linear width measures, hardness proofs, ddc:004, W-hierarchy, Linear mim-width, Software, linear clique-width

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2201.13119
https://research-portal.uu.nl/en/publications/df89aedd-7a2e-4055-938c-d21b56bced16
https://doi.org/10.1007/s00453-024-01274-9
https://hdl.handle.net/11250/3041006
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.8
https://dspace.library.uu.nl/handle/1874/425595
https://hdl.handle.net/11250/3170553

((n−2)\)-Fault-Tolerant Edge-Pancyclicity of Möbius Cubes \(MQ_n\): \((n-2)\)-fault-tolerant edge-pancyclicity of Möbius cubes \(MQ_n\).

Συγγραφείς: Zhang, Huifeng, Zhu, Jun, Xu, Xirong, Zhang, Peng

Πηγή: Ars Combinatoria. 161:29-47

Θεματικοί όροι: fault-tolerant, edge-pancyclicity, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, combinatorics, Möbius cube, interconnection network

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7980761
https://doi.org/10.61091/ars161-03

Jet: Multilevel Graph Partitioning on Graphics Processing Units: Jet: multilevel graph partitioning on graphics processing units

Συγγραφείς: Michael S. Gilbert, Kamesh Madduri, Erik G. Boman, Siva Rajamanickam

Πηγή: SIAM Journal on Scientific Computing. 46:B700-B724

Θεματικοί όροι: FOS: Computer and information sciences, graph partitioning, GPUs, Computer Science - Distributed, Parallel, and Cluster Computing, Discrete Mathematics (cs.DM), Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), refinement, Distributed, Parallel, and Cluster Computing (cs.DC), Parallel algorithms in computer science, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2304.13194

Determining Vulnerability of Central Networks Using Closeness and Nordhaus–Gaddum Type Relation: Determining vulnerability of central networks using closeness and Nordhaus-Gaddum type relation

Συγγραφείς: Golpek, H. T., Aytac, A. O.

Πηγή: Mathematical Notes. 116:614-626

Θεματικοί όροι: Network design and communication in computer systems, graph vulnerability, Graph theory (including graph drawing) in computer science, Nordhaus–Gaddum, closeness, Small world graphs, complex networks (graph-theoretic aspects), Nordhaus-Gaddum

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8005077
https://doi.org/10.1134/s0001434624090219
https://hdl.handle.net/11454/117157
https://doi.org/10.1134/S0001434624090219

Finding single-source shortest paths from unweighted directed graphs combining rough sets theory and marking strategy

Συγγραφείς: Taihua Xu, Mingfeng Hua, Xibei Yang, Yun Cui, Fei Wang, Shuai Li

Πηγή: Journal of Applied Mathematics and Computing. 70:5993-6012

Θεματικοί όροι: unweighted directed graphs, single-source shortest paths, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), rough sets theory, marking strategy

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8036691
https://doi.org/10.1007/s12190-024-02201-5

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs: Simpler and unified recognition algorithm for path graphs and directed path graphs

Συγγραφείς: Balzotti, Lorenzo

Πηγή: Discrete Mathematics & Theoretical Computer Science.

Θεματικοί όροι: FOS: Computer and information sciences, F.2.2, G.2.2, path graphs, Directed graphs (digraphs), tournaments, 0102 computer and information sciences, recognition algorithms, intersection graphs, 01 natural sciences, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, directed path graphs, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0101 mathematics, Paths and cycles

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2012.08476

Randomized Algorithms to Generate Hypergraphs with Given Degree Sequences: Randomized algorithms to generate hypergraphs with given degree sequences

Συγγραφείς: Michela Ascolese, Matthias Lienau, Matthias Schulte, Anusch Taraz

Πηγή: The Electronic Journal of Combinatorics. 32

Θεματικοί όροι: Biomedical imaging and signal processing, Graph theory (including graph drawing) in computer science, Randomized algorithms, Random graphs (graph-theoretic aspects), Mathematics - Combinatorics, Hypergraphs, Mathematics - Probability, Randomized algorithm, Uniform hypergraph, Random graphs

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2402.04737
https://zbmath.org/8036394
https://doi.org/10.37236/12748
https://hdl.handle.net/2158/1420735
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v32i2p15
https://doi.org/10.37236/12748

Twin‐width of random graphs: Twin-width of random graphs

Συγγραφείς: Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Donggyu Kim, Sang‐il Oum

Πηγή: Random Structures & Algorithms. 65:794-831

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Random graphs (graph-theoretic aspects), twin-width, 0102 computer and information sciences, 01 natural sciences, Graph theory (including graph drawing) in computer science, threshold, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics, 05C35, random graph, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2212.07880

Novel resolvability parameter of some well-known graphs and exchange properties with applications

Συγγραφείς: Sikander Ali, Muhammad Azeem, Manzoor Ahmad Zahid, Muhammad Usman, Madhumangal Pal

Πηγή: Journal of Applied Mathematics and Computing. 70:4373-4394

Θεματικοί όροι: edge fault-tolerant metric dimension, Network design and communication in computer systems, Graph theory (including graph drawing) in computer science, resolving set, edge metric dimension, fault-tolerant mixed metric dimension, Small world graphs, complex networks (graph-theoretic aspects), metric dimension, fault-tolerant metric dimension

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8035065
https://doi.org/10.1007/s12190-024-02137-w

On star-k-PCGs: exploring class boundaries for small k values: On star-\(k\)-PCGs: exploring class boundaries for small \(k\) values

Συγγραφείς: Monti, Angelo, Sinaimeri, Blerina

Πηγή: Acta Informatica. 62

Θεματικοί όροι: star number, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), cycles, caterpillars, 0102 computer and information sciences, G.2.2, grids, 01 natural sciences, pairwise compatibility graphs, multi-threshold graphs, Signed and weighted graphs, Graph theory (including graph drawing) in computer science, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05Cxx, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2209.11860
https://zbmath.org/8022617
https://doi.org/10.1007/s00236-025-00485-z