Search Results - Theory of computation → Graph algorithms analysis
-
1
Authors: et al.
Contributors: et al.
Source: ACM Transactions on Algorithms
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)Subject Terms: Genomics (q-bio.GN), FOS: Computer and information sciences, Computer and information sciences, Discrete Mathematics (cs.DM), 0206 medical engineering, Graph algorithm, strong connectivity, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computation theory, Genes, Graph theory, Program assemblers, Reachability under failures, Strong connectivity, Bioinformatics, Theory of computation → Graph algorithms analysis, Mathematics of computing → Paths and connectivity problems, reachability under failures, FOS: Biological sciences, FOS: Mathematics, Mathematics - Combinatorics, Quantitative Biology - Genomics, Applied computing → Computational biology, Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
File Description: application/pdf
Access URL: http://arxiv.org/abs/2002.10498
https://dblp.uni-trier.de/db/conf/icalp/icalp2021.html#CairoRTZ21
https://drops.dagstuhl.de/opus/volltexte/2021/14112/
https://drops.dagstuhl.de/opus/volltexte/2021/14112/pdf/LIPIcs-ICALP-2021-43.pdf/
https://helda.helsinki.fi/handle/10138/332217
https://doi.org/10.4230/LIPIcs.ICALP.2021.43
https://researchportal.helsinki.fi/en/publications/genome-assembly-from-practice-to-theory -safe-complete-and-linear-
http://hdl.handle.net/10138/332217
http://hdl.handle.net/10138/568677
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.43
https://hdl.handle.net/11562/1057335
https://doi.org/10.4230/lipics.icalp.2021.43 -
2
Authors: et al.
Contributors: et al.
Source: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14
41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)Subject Terms: FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), Theory of computation → Graph algorithms analysis, graph homomorphism, parameterised complexity, Computer Science - Data Structures and Algorithms, counting complexity, FOS: Mathematics, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
File Description: application/pdf
-
3
Authors: et al.
Contributors: et al.
Source: ACM Transactions on Computation Theory. 16:1-18
Subject Terms: FOS: Computer and information sciences, Mathematics of computing → Approximation algorithms, Discrete Mathematics (cs.DM), subexponential-time algorithm, Mathematics of computing → Graph algorithms, 4. Education, 7. Clean energy, subdivided claw, Max Independent Set, Theory of computation → Graph algorithms analysis, Computer Science - Data Structures and Algorithms, QPTAS, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
File Description: application/pdf
-
4
Authors: et al.
Contributors: et al.
Subject Terms: FOS: Computer and information sciences, algorithm, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], graph, VC-dimension, Algorithm, Theory of computation → Graph algorithms analysis, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Theory of computation → Algorithm design techniques, Graphs
File Description: application/pdf
-
5
Authors: Aguirre Guerrero, Daniela
Contributors: University/Department: Universitat de Girona. Departament d'Arquitectura i Tecnologia de Computadors, University/Department: Universitat de Girona. Institut d'Informàtica i Aplicacions
Thesis Advisors: Vilà Talleda, Pere, Fàbrega i Soler, Lluís
Source: TDX (Tesis Doctorals en Xarxa)
Subject Terms: Fault-tolerant routing, Encaminamiento tolerante a fallos, Encaminament tolerant a fallades, Cayley graphs, Grafos de Cayley, Grafs de Cayley, Automatic group theory, Teoría de grupos automáticos, Teoria de grups automàtics, Path computation algorithms, Algoritmos de búsqueda de caminos, Algoritmes de cerca de camins
File Description: application/pdf
Access URL: http://hdl.handle.net/10803/667410
-
6
Authors: et al.
Contributors: et al.
Source: SIAM Journal on Discrete Mathematics. 38:2392-2415
Subject Terms: FOS: Computer and information sciences, 0102 computer and information sciences, Computational Complexity (cs.CC), 15. Life on land, 01 natural sciences, 68W99, 7. Clean energy, Theory of computation → Packing and covering problems, Theory of computation → Fixed parameter tractability, essential vertices, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, Theory of computation → Linear programming, Data Structures and Algorithms (cs.DS), ddc:004, covering versus packing, F.2.0
File Description: application/pdf
-
7
Authors: Xu, Jin
Subject Terms: Graph Theory, Planar Graphs, Chromatic Polynomial, Maximal Planar Graph, Four Color Conjecture, Discharging Proof Techniques, Graph Isomorphism Algorithms, Recursive Graph Construction, Mathematical theory of computation
File Description: application/pdf
-
8
Authors:
Source: ISSN: 1868-8969.
Subject Terms: Fine-grained complexity theory, Dominating set, Sparsity in graphs, Conditionally optimal algorithms, Theory of computation → Graph algorithms analysis, Theory of computation → Parameterized complexity and exact algorithms, Theory of computation → Problems, reductions and completeness, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
File Description: application/pdf
Relation: Leibniz international proceedings in informatics : LIPIcs / Schloss Dagstuhl Leibniz-Zentrum für Informatik; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-353-9; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000179197; https://publikationen.bibliothek.kit.edu/1000179197/157077211; https://doi.org/10.5445/IR/1000179197
-
9
Authors: et al.
Contributors: et al.
Source: 29th Annual European Symposium on Algorithms (ESA 2021)
Subject Terms: graph isomorphism, Weisfeiler-Leman algorithm, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0102 computer and information sciences, 01 natural sciences, Mathematics of computing → Graphs and surfaces, Theory of computation → Fixed parameter tractability, Theory of computation → Graph algorithms analysis, Euler genus, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
File Description: application/pdf
Access URL: http://arxiv.org/abs/2106.14869
https://drops.dagstuhl.de/opus/volltexte/2021/14653/
https://publications.cispa.saarland/id/eprint/3458
https://doi.org/10.4230/LIPIcs.ESA.2021.72
https://dblp.uni-trier.de/db/journals/corr/corr2106.html#abs-2106-14869
https://drops.dagstuhl.de/opus/volltexte/2021/14653/pdf/LIPIcs-ESA-2021-72.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.72 -
10
Authors: et al.
Contributors: et al.
Source: 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Subject Terms: FOS: Computer and information sciences, sparsification, Sparsification, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), List H-coloring, 01 natural sciences, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, List H-Coloring, Mathematics of computing → Graph coloring, Theory of computation → Parameterized complexity and exact algorithms, ddc:004, Constraint Satisfaction Problem, constraint satisfaction problem
File Description: application/pdf
Access URL: http://arxiv.org/abs/2009.08353
https://research.tue.nl/en/publications/6cd0cd13-e63b-4cca-9d3b-800c69a29ca0
https://doi.org/10.1145/3612938
https://arxiv.org/abs/2009.08353
https://drops.dagstuhl.de/opus/volltexte/2020/13402/pdf/LIPIcs-ISAAC-2020-58.pdf/
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-08353
https://arxiv.org/pdf/2009.08353
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-08353
https://drops.dagstuhl.de/opus/volltexte/2020/13402/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.58 -
11
Authors: et al.
Contributors: et al.
Subject Terms: Theory of computation → Graph algorithms analysis, Dilworth's Theorem, DAGs, Treewidth, Temporally Disjoint Paths, Theory of computation → Parameterized complexity and exact algorithms, Oriented Trees, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Path Cover, Temporal Graphs, ddc:004, Algorithms
File Description: application/pdf
-
12
Authors: et al.
Contributors: et al.
Source: 19th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2024)
Theory of Quantum Computation, Communication and Cryptography (TQC 2024)
https://hal.science/hal-04516220
Theory of Quantum Computation, Communication and Cryptography (TQC 2024), Sep 2024, Okinawa, Japan. pp.1-16, ⟨10.4230/LIPIcs.TQC.2024.8⟩Subject Terms: Graph Property testing, Theory of computation → Graph algorithms analysis, Theory of computation → Proof complexity, classical Query lower Bound, Quantum Algorithm, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2311.10480; ARXIV: 2311.10480
-
13
Authors:
Contributors:
Subject Terms: ddc:004, FOS: Computer and information sciences, Conditionally optimal algorithms, F.2, DATA processing & computer science, reductions and completeness, Theory of computation → Graph algorithms analysis, Dominating set, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Theory of computation → Problems, Data Structures and Algorithms (cs.DS), Sparsity in graphs, Fine-grained complexity theory
File Description: application/pdf
-
14
Authors: Aragonès Martín, Àngels
Contributors: University/Department: Universitat Ramon Llull. EALS - Comunicacions i Teoria del Senyal
Thesis Advisors: Guasch Fortuny, Oriol
Source: TDX (Tesis Doctorals en Xarxa)
Subject Terms: Graph theory, Transmission Path Analysis, Mid-frequency, Teoria de grafs, Vibroacoustics, Vibroacústica, Vies de transmissió, Statistical Energy Analysis, Enginyeria i Arquitectura
Time: 519.1
File Description: application/pdf
Access URL: http://hdl.handle.net/10803/299378
-
15
Authors: et al.
Contributors: et al.
Source: Algorithmica
15th International Symposium on Parameterized and Exact Computation (IPEC 2020)Subject Terms: partially ordered set, FOS: Computer and information sciences, permutation graphs, Discrete Mathematics (cs.DM), 0102 computer and information sciences, 01 natural sciences, Article, Theory of computation → Graph algorithms analysis, Computer Science - Data Structures and Algorithms, comparability graphs, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics, graph modification problems, Computer Science - Discrete Mathematics
File Description: application/pdf
Access URL: https://link.springer.com/content/pdf/10.1007/s00453-021-00923-7.pdf
https://pubmed.ncbi.nlm.nih.gov/35880199
http://arxiv.org/abs/2010.11440
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.5
https://ruj.uj.edu.pl/xmlui/handle/item/317252
https://ruj.uj.edu.pl/xmlui/handle/item/259372 -
16
Authors: et al.
Source: ISSN: 1868-8969.
Subject Terms: fine-grained complexity theory, domination in graphs, subgraph isomorphism, classification theorem, parameterized algorithms, Theory of computation → Graph algorithms analysis, Theory of computation → Parameterized complexity and exact algorithms, Theory of computation → Problems, reductions and completeness, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
File Description: application/pdf
Relation: Leibniz International Proceedings in Informatics (LIPIcs); info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000187239; https://publikationen.bibliothek.kit.edu/1000187239/169678057; https://doi.org/10.5445/IR/1000187239
-
17
-
18
Authors: et al.
Contributors: et al.
Source: https://inria.hal.science/hal-04863343 ; 2025.
Subject Terms: Temporal graphs, Dynamic networks, Time-dependent networks, Fastest temporal path, Fine-grained complexity, 2012 ACM Subject Classification Theory of computation → Graph algorithms analysis, Theory of computation → Shortest paths phrases Temporal graphs Dynamic networks Time-dependent networks Fastest temporal path Fine-grained complexity, Theory of computation → Shortest paths phrases Temporal graphs, Temporal graphs Dynamic networks Time-dependent networks Fastest temporal path Shortest temporal path Fine-grained complexity, Shortest temporal path, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
-
19
Authors: et al.
Contributors: et al.
Source: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
AlgorithmicaSubject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Clique Width, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Bubble Model, Computational Complexity (cs.CC), MaxCut Problem, 01 natural sciences, Subexponential Algorithm, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, Interval Graphs, Computer Science - Data Structures and Algorithms, Mixed Unit Interval Graphs, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics
File Description: application/pdf
Access URL: https://link.springer.com/content/pdf/10.1007/s00453-021-00837-4.pdf
http://arxiv.org/abs/2002.08311
https://link.springer.com/content/pdf/10.1007/s00453-021-00837-4.pdf
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica83.html#KratochvilMN21
https://paperity.org/p/271655816/mathcal-u-u-bubble-model-for-mixed-unit-interval-graphs -and-its-applications-the-maxcut
https://link.springer.com/article/10.1007/s00453-021-00837-4
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.57 -
20
Authors: et al.
Contributors: et al.
Source: 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Leibniz International Proceedings in Informatics (LIPIcs)
Mathematical Foundations of Computer Science (MFCS)
https://hal.science/hal-04818742
Mathematical Foundations of Computer Science (MFCS), Aug 2024, Bratislava, Slovakia. pp.1-16, ⟨10.4230/LIPIcs.MFCS.2024.19⟩Subject Terms: 2012 ACM Subject Classification Theory of computation → Online algorithms Theory of computation → Graph algorithms analysis Mathematics of computing → Graph algorithms phrases Canadian Traveller Problem, Online algorithms, Competitive analysis, Outerplanar graphs, 2012 ACM Subject Classification Theory of computation → Online algorithms, Theory of computation → Graph algorithms analysis, Mathematics of computing → Graph algorithms phrases Canadian Traveller Problem, Canadian Traveller Problem, Theory of computation → Online algorithms, Mathematics of computing → Graph algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Subject Geographic: Bratislava, Slovakia
Full Text Finder 
Nájsť tento článok vo Web of Science