Beyond Shortest Paths: Node Fairness in Route Recommendation

Συγγραφείς: Ferrara, Antonio, García Soriano, David, Bonchi, Francesco

Πηγή: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Θεματικοί όροι: Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica, Graph algorithms analysis, Dynamic graph algorithms, Paths and connectivity problems, Shortest paths, Graph algorithms

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

Σύνδεσμος πρόσβασης: https://hdl.handle.net/2117/441585
https://doi.org/10.14778/3746405.3746440

Graph Optimization for Water Distribution Network

Συγγραφείς: N, Sumith, Verma, Aditya

Πηγή: 2023 IEEE 2nd International Conference on Data, Decision and Systems (ICDDS) Data, Decision and Systems (ICDDS), 2023 IEEE 2nd International Conference on. :1-4 Dec, 2023

Relation: 2023 IEEE 2nd International Conference on Data, Decision and Systems (ICDDS)

The Complexity of Homomorphism Reconstructibility

Συγγραφείς: Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

Συνεισφορές: Jan Böker and Louis Härtel and Nina Runde and Tim Seppelt and Christoph Standke

Πηγή: 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)

Θεματικοί όροι: 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

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

Σύνδεσμος πρόσβασης: 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

Recognition Complexity of Subgraphs of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {k}}$$\end{document}-Connected Planar Cubic Graphs

Συγγραφείς: Goetze, Miriam^{Aff1, IDs00453025013508_cor1}, Jungeblut, Paul, Ueckerdt, Torsten

Πηγή: Algorithmica. 88(1)

Search-Space Reduction via Essential Vertices

Συγγραφείς: Bumpus, Benjamin Merlin, Jansen, Bart M. P., de Kroon, Jari J. H.

Συνεισφορές: Benjamin Merlin Bumpus and Bart M. P. Jansen and Jari J. H. de Kroon, Chechik, Shiri, Navarro, Gonzalo, Rotenberg, Eva, Herman, Grzegorz

Πηγή: SIAM Journal on Discrete Mathematics. 38:2392-2415

Θεματικοί όροι: 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

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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Majewski, Konrad, Masařík, Tomáš, Novotná, Jana, Okrasa, Karolina, Pilipczuk, Marcin, Rzążewski, Paweł, Sokołowski, Marek

Συνεισφορές: Konrad Majewski and Tomáš Masařík and Jana Novotná and Karolina Okrasa and Marcin Pilipczuk and Paweł Rzążewski and Marek Sokołowski, Bojańczyk, Mikołaj, Merelli, Emanuela, Woodruff, David P.

Πηγή: ACM Transactions on Computation Theory. 16:1-18

Θεματικοί όροι: 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

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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Neuen, Daniel

Συνεισφορές: Daniel Neuen, Mutzel, Petra, Pagh, Rasmus, Herman, Grzegorz

Πηγή: 29th Annual European Symposium on Algorithms (ESA 2021)

Θεματικοί όροι: 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

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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Paweł Rzążewski

Συνεισφορές: Hubie Chen and Bart M. P. Jansen and Karolina Okrasa and Astrid Pieterse and Paweł Rzążewski, Cao, Yixin, Cheng, Siu-Wing, Li, Minming

Πηγή: 31st International Symposium on Algorithms and Computation (ISAAC 2020)

Θεματικοί όροι: 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

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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli

Συνεισφορές: Department of Computer Science, Algorithmic Bioinformatics, Bioinformatics, Massimo Cairo and Romeo Rizzi and Alexandru I. Tomescu and Elia C. Zirondelli, Bansal, Nikhil, Merelli, Emanuela, Worrell, James

Πηγή: ACM Transactions on Algorithms
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)

Θεματικοί όροι: 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

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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Fischer, Nick, Künnemann, Marvin, Redžić, Mirza, Stieß, Julian, Censor-Hillel, Keren, Grandoni, Fabrizio, Ouaknine, Joel, Puppis, Gabriele

Θεματικοί όροι: 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

Συγγραφείς: Dransfeld, Jonathan, Künnemann, Marvin, Redzic, Mirza, Benoit, Anne, Kaplan, Haim, Wild, Sebastian, Herman, Grzegorz

Πηγή: ISSN: 1868-8969.

Θεματικοί όροι: 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

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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

Συγγραφείς: Künnemann, Marvin, Redzic, Mirza

Πηγή: ISSN: 1868-8969.

Θεματικοί όροι: 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

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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

Συγγραφείς: Léo Exibard, Emmanuel Filiot, Ayrat Khalimov

Συνεισφορές: Karolina Okrasa and Paweł Rzążewski, Léo Exibard and Emmanuel Filiot and Ayrat Khalimov, EXIBARD, Léo, Bläser, Markus, Monmege, Benjamin

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

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf; 1 full-text file(s): application/pdf

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Beaudou, Laurent, Bergé, Pierre, Chernyshev, Vsevolod, Dailly, Antoine, Gerard, Yan, Lagoutte, Aurélie, Limouzy, Vincent, Pastor, Lucas

Συνεισφορές: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Optimisation Combinatoire (G-SCOP_OC), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA), ANR-21-CE48-0004,GRALMECO,Algorithmique des problèmes de couverture métriques dans les graphes(2021), ANR-16-IDEX-0001,CAP 20-25,CAP 20-25(2016)

Πηγή: 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⟩

Θεματικοί όροι: 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]

Θέμα γεωγραφικό: Bratislava, Slovakia

Διαθεσιμότητα: 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

Συγγραφείς: Aubian, Guillaume, Brunelli, Filippo, Dragan, Feodor, F, Ducoffe, Guillaume, Habib, Michel, Ibiapina, Allen, Viennot, Laurent

Συνεισφορές: Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Université Paris Cité (UPCité), European Commission - Joint Research Centre Seville (JRC), Kent State University, University of Bucharest (UniBuc), National Institute for Research and Development in Informatics Bucharest (ICI), Département d'informatique - ENS-PSL (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Apprentissage, graphes et optimisation distribuée (ARGO), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), ANR-22-CE48-0001,TEMPOGRAL,Problèmes algorithmiques sur les graphes temporels(2022)

Πηγή: https://inria.hal.science/hal-04863343 ; 2025.

Θεματικοί όροι: Fastest temporal path, Shortest temporal path, Temporal graphs, Temporal graphs Dynamic networks Time-dependent networks Fastest temporal path Shortest temporal path Fine-grained complexity, Theory of computation → Shortest paths phrases Temporal graphs, Theory of computation → Shortest paths phrases Temporal graphs Dynamic networks Time-dependent networks Fastest temporal path Fine-grained complexity, 2012 ACM Subject Classification Theory of computation → Graph algorithms analysis, Fine-grained complexity, Time-dependent networks, Dynamic networks, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Διαθεσιμότητα: 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

Συγγραφείς: Donkers, Huib, Jansen, Bart M. P., Włodarczyk, Michał

Συνεισφορές: Huib Donkers and Bart M. P. Jansen and Michał Włodarczyk, Golovach, Petr A., Zehavi, Meirav

Πηγή: Algorithmica
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021

Θεματικοί όροι: 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

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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Coudert, David, Csikós, Mónika, Ducoffe, Guillaume, Viennot, Laurent

Συνεισφορές: Viennot, Laurent, David Coudert and Mónika Csikós and Guillaume Ducoffe and Laurent Viennot

Θεματικοί όροι: 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

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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Chakraborty, Dibyayan, Dailly, Antoine, Foucaud, Florent, Klasing, Ralf

Συνεισφορές: Dibyayan Chakraborty and Antoine Dailly and Florent Foucaud and Ralf Klasing, Klasing, Ralf

Θεματικοί όροι: 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

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

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

Buffered Streaming Edge Partitioning

Συγγραφείς: Chhabra, Adil, Fonseca Faraj, Marcelo, Schulz, Christian, Seemaier, Daniel

Συνεισφορές: Adil Chhabra and Marcelo Fonseca Faraj and Christian Schulz and Daniel Seemaier

Θεματικοί όροι: 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

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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Seppelt, Tim Frederik

Συνεισφορές: Tim Seppelt

Πηγή: 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

Θεματικοί όροι: 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

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

Σύνδεσμος πρόσβασης: 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