Výsledky vyhľadávania - "Theory of computation → Graph algorithms analysis"

The Complexity of Homomorphism Reconstructibility

Autori: Jan Böker Louis Härtel Nina Runde a ďalší

Prispievatelia: Jan Böker Louis Härtel Nina Runde a ďalší

Zdroj: 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)

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2310.09009
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.19
https://publications.rwth-aachen.de/record/981455

Search-Space Reduction via Essential Vertices

Autori: Bumpus, Benjamin Merlin Jansen, Bart M. P. de Kroon, Jari J. H. a ďalší

Prispievatelia: Bumpus, Benjamin Merlin Jansen, Bart M. P. de Kroon, Jari J. H. a ďalší

Zdroj: SIAM Journal on Discrete Mathematics. 38:2392-2415

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2207.00386
https://research.tue.nl/en/publications/56170a91-b485-4bd7-8534-78fafe8b19a7
https://doi.org/10.1137/23M1589347
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.30

Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument

Autori: Majewski, Konrad Masařík, Tomáš Novotná, Jana a ďalší

Prispievatelia: Majewski, Konrad Masařík, Tomáš Novotná, Jana a ďalší

Zdroj: ACM Transactions on Computation Theory. 16:1-18

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2203.04836
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.93

Isomorphism Testing Parameterized by Genus and Beyond

Autori: Neuen, Daniel Daniel Neuen Mutzel, Petra a ďalší

Prispievatelia: Neuen, Daniel Daniel Neuen Mutzel, Petra a ďalší

Zdroj: 29th Annual European Symposium on Algorithms (ESA 2021)

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

Sparsification Lower Bounds for List H -Coloring

Autori: Hubie Chen Bart M. P. Jansen Karolina Okrasa a ďalší

Prispievatelia: Hubie Chen Bart M. P. Jansen Karolina Okrasa a ďalší

Zdroj: 31st International Symposium on Algorithms and Computation (ISAAC 2020)

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time

Autori: Massimo Cairo Romeo Rizzi Alexandru I. Tomescu a ďalší

Prispievatelia: Massimo Cairo Romeo Rizzi Alexandru I. Tomescu a ďalší

Zdroj: ACM Transactions on Algorithms
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs

Autori: Fischer, Nick Künnemann, Marvin Redžić, Mirza a ďalší

Predmety: clique detections in hypergraphs, reductions and completeness, Theory of computation → Graph algorithms analysis, parameterized algorithms, constraint satisfaction, Theory of computation → Problems, fine-grained complexity theory

Fine-Grained Classification of Detecting Dominating Patterns

Autori: Dransfeld, Jonathan Künnemann, Marvin Redzic, Mirza a ďalší

Zdroj: ISSN: 1868-8969.

Predmety: 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

Popis súboru: 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

Dostupnosť: https://publikationen.bibliothek.kit.edu/1000187239
https://publikationen.bibliothek.kit.edu/1000187239/169678057
https://doi.org/10.5445/IR/1000187239

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs

Autori: Künnemann, Marvin Redzic, Mirza

Zdroj: ISSN: 1868-8969.

Predmety: 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

Popis súboru: 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

Dostupnosť: https://publikationen.bibliothek.kit.edu/1000179197
https://publikationen.bibliothek.kit.edu/1000179197/157077211
https://doi.org/10.5445/IR/1000179197

Church synthesis on register automata over linearly ordered data domains

Autori: Léo Exibard Emmanuel Filiot Ayrat Khalimov a ďalší

Prispievatelia: Léo Exibard Emmanuel Filiot Ayrat Khalimov a ďalší

Zdroj: Leibniz international proceedings in informatics, 187
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)

Predmety: FOS: Computer and information sciences, Ordered Data Words, Formal Languages and Automata Theory (cs.FL), Register Automata, Transducers, list homomorphism, Computer Science - Formal Languages and Automata Theory, 02 engineering and technology, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Synthesis, fine-grained complexity, Informatique mathématique, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], hereditary graph classes, Theory of computation → Problems, reductions and completeness, Généralités, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, Mathematics of computing → Graph coloring, Church Game, ddc:004

Popis súboru: application/pdf; 1 full-text file(s): application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2004.12141
http://arxiv.org/abs/2010.03393
https://arxiv.org/abs/2004.12141
http://arxiv.org/pdf/2004.12141.pdf
http://ui.adsabs.harvard.edu/abs/2020arXiv200412141E/abstract
https://dblp.uni-trier.de/db/conf/stacs/stacs2021.html#ExibardFK21
https://drops.dagstuhl.de/opus/volltexte/2021/13673/pdf/LIPIcs-STACS-2021-28.pdf/
https://doi.org/10.4230/LIPIcs.STACS.2021.28
https://drops.dagstuhl.de/opus/volltexte/2021/13673/
https://drops.dagstuhl.de/opus/volltexte/2021/13699/pdf/LIPIcs-STACS-2021-54.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/13699/
https://dblp.uni-trier.de/db/journals/corr/corr2010.html#abs-2010-03393
https://doi.org/10.4230/LIPIcs.STACS.2021.54
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.54
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.28
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/332374
https://hal.science/hal-03409588v1/document
https://doi.org/10.4230/lipics.stacs.2021.54
https://hal.science/hal-03409588v1

The Canadian Traveller Problem on Outerplanar Graphs

Autori: Beaudou, Laurent Bergé, Pierre Chernyshev, Vsevolod a ďalší

Prispievatelia: Beaudou, Laurent Bergé, Pierre Chernyshev, Vsevolod a ďalší

Zdroj: 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⟩

Predmety: 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]

Geografické téma: Bratislava, Slovakia

Dostupnosť: https://hal.science/hal-04818742
https://hal.science/hal-04818742v1/document
https://hal.science/hal-04818742v1/file/LIPIcs.MFCS.2024.19.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2024.19

On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs

Autori: Aubian, Guillaume Brunelli, Filippo Dragan, Feodor, F a ďalší

Prispievatelia: Aubian, Guillaume Brunelli, Filippo Dragan, Feodor, F a ďalší

Zdroj: https://inria.hal.science/hal-04863343 ; 2025.

Predmety: 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]

Dostupnosť: https://inria.hal.science/hal-04863343
https://inria.hal.science/hal-04863343v1/document
https://inria.hal.science/hal-04863343v1/file/main-hal.pdf

Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size: An Elementary Kernel of Quartic Size

Autori: Donkers, Huib Jansen, Bart M. P. Włodarczyk, Michał a ďalší

Prispievatelia: Donkers, Huib Jansen, Bart M. P. Włodarczyk, Michał a ďalší

Zdroj: Algorithmica
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021

Predmety: outerplanar graphs, FOS: Computer and information sciences, Outerplanar graphs, Mathematics of computing → Graph algorithms, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Mathematics of computing → Graphs and surfaces, Theory of computation → Graph algorithms analysis, fixed-parameter tractability, Fixed-parameter tractability, kernelization, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Kernelization, Data Structures and Algorithms (cs.DS), ddc:004

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2110.01868
https://research.tue.nl/en/publications/83d8fa60-bba3-4c85-b7b2-ee39000667f4
https://doi.org/10.4230/LIPIcs.IPEC.2021.14
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.14

Practical Computation of Graph VC-Dimension

Autori: Coudert, David Csikós, Mónika Ducoffe, Guillaume a ďalší

Prispievatelia: Coudert, David Csikós, Mónika Ducoffe, Guillaume a ďalší

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2405.07588
https://hal.science/hal-04553784v1
https://doi.org/10.4230/lipics.sea.2024.8
https://hal.science/hal-04553784v1/document
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.8

Algorithms and Complexity for Path Covers of Temporal DAGs

Autori: Chakraborty, Dibyayan Dailly, Antoine Foucaud, Florent a ďalší

Prispievatelia: Chakraborty, Dibyayan Dailly, Antoine Foucaud, Florent a ďalší

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.38

Buffered Streaming Edge Partitioning

Autori: Chhabra, Adil Fonseca Faraj, Marcelo Schulz, Christian a ďalší

Prispievatelia: Chhabra, Adil Fonseca Faraj, Marcelo Schulz, Christian a ďalší

Predmety: ddc:004, graph partitioning, DATA processing & computer science, sublinear and near linear time algorithms, Theory of computation → Streaming, edge partitioning, buffered partitioning, Theory of computation → Graph algorithms analysis, Computer Science - Data Structures and Algorithms, streaming, online

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2402.11980
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.5
https://publikationen.bibliothek.kit.edu/1000173355
https://doi.org/10.5445/IR/1000173355
https://publikationen.bibliothek.kit.edu/1000173355/154079176

An Algorithmic Meta Theorem for Homomorphism Indistinguishability

Autori: Seppelt, Tim Frederik Tim Seppelt

Prispievatelia: Seppelt, Tim Frederik Tim Seppelt

Zdroj: Saarbrücken/Wadern, Germany : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 306, 82:1-82:19 (2024). doi:10.4230/LIPIcs.MFCS.2024.82
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera49. International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, 2024-08-26-2024-08-30
49th International Symposium on Mathematical Foundations of Computer Science

Predmety: Computer Science - Logic in Computer Science, Mathematics of computing → Graph theory, recognisability, Mathematics of computing → Combinatorics, graph minor, Courcelle's Theorem, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, graph homomorphism, randomised algorithm, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, homomorphism indistinguishability, ddc:004, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2402.08989
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.82
https://publications.rwth-aachen.de/record/991819

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs

Autori: Künnemann, Marvin Redzic, Mirza Marvin Künnemann and Mirza Redzic

Prispievatelia: Künnemann, Marvin Redzic, Mirza Marvin Künnemann and Mirza Redzic

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2409.08037
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.9
https://publikationen.bibliothek.kit.edu/1000179197/157077211
https://doi.org/10.5445/IR/1000179197
https://publikationen.bibliothek.kit.edu/1000179197

Many-visits TSP revisited

Autori: Kowalik, Łukasz Li, Shaohua Nadara, Wojciech a ďalší

Prispievatelia: Kowalik, Łukasz Li, Shaohua Nadara, Wojciech a ďalší

Zdroj: 28th Annual European Symposium on Algorithms (ESA 2020)
J. Comput. Syst. Sci.

Predmety: Theory of computation → Graph algorithms analysis, exponential algorithm, many visits traveling salesman problem, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Theory of computation → Parameterized complexity and exact algorithms, 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2005.02329
https://www.sciencedirect.com/science/article/pii/S0022000021000908
https://arxiv.org/abs/2005.02329
https://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-02329
https://drops.dagstuhl.de/opus/volltexte/2020/12932/
https://drops.dagstuhl.de/opus/volltexte/2020/12932/pdf/LIPIcs-ESA-2020-66.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.66

Vertex Deletion into Bipartite Permutation Graphs

Autori: Bożyk, Łukasz Derbisz, Jan Krawczyk, Tomasz a ďalší

Prispievatelia: Bożyk, Łukasz Derbisz, Jan Krawczyk, Tomasz a ďalší

Zdroj: Algorithmica
15th International Symposium on Parameterized and Exact Computation (IPEC 2020)

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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