Výsledky vyhledávání - "Algorithmic graph theory"

Vertex Connectivity in Poly-logarithmic Max-Flows

Autoři: Li, Jason Na Nongkai, Danupon Panigrahi, Debmalya a další

Zdroj: Journal of the ACM. 72(4):1-34

Témata: Algorithmic graph theory, vertex connectivity

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-372447
https://doi.org/10.1145/3743670

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness

Autoři: Yonggang Jiang Chaitanya Nalam Thatchaphol Saranurak a další

Přispěvatelé: Yonggang Jiang Chaitanya Nalam Thatchaphol Saranurak a další

Zdroj: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing

Témata: FOS: Computer and information sciences, Vertex Connectivity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Algorithmic Graph Theory

Popis souboru: application/application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2503.20985
http://hdl.handle.net/20.500.11850/745267

Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations

Autoři: Joakim Blikstad Yonggang Jiang Sagnik Mukhopadhyay a další

Přispěvatelé: Joakim Blikstad Yonggang Jiang Sagnik Mukhopadhyay a další

Zdroj: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing

Témata: FOS: Computer and information sciences, Vertex Connectivity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Parallel Computation, Algorithmic Graph Theory, Distributed Computation

Popis souboru: application/application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2503.20366
http://hdl.handle.net/20.500.11850/745268

Topological graphs: a review of some of our achievements and perspectives in physical chemistry and homogeneous catalysis

Autoři: Sana Bougueroua Ylène Aboulfath Alvaro Cimas a další

Přispěvatelé: Sana Bougueroua Ylène Aboulfath Alvaro Cimas a další

Zdroj: Comptes Rendus. Chimie, Vol, Iss, Pp 1-23 (2024)

Témata: Conformational search, Physical and theoretical chemistry, QD450-801, Reaction network, QD415-436, Molecular dynamics, Biochemistry, Algorithmic graph theory, Identification of conformers, QA1-939, Pathways, [CHIM.CHEM]Chemical Sciences/Cheminformatics, Mathematics

Přístupová URL adresa: https://doaj.org/article/a961302483414df986633f4033f053e6

Tree independence number I. (Even hole, diamond, pyramid)‐free graphs

Autoři: Tara Abrishami Bogdan Alecu Maria Chudnovsky a další

Zdroj: Journal of Graph Theory. 106:923-943

Témata: even-hole-free graphs, tree independence number, structural graph theory, treewidth, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), algorithmic graph theory

Přístupová URL adresa: http://arxiv.org/abs/2305.16258

Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity

Autoři: Yingchareonthawornchai Sorrachai Franck, Max a další

Přispěvatelé: Yingchareonthawornchai Sorrachai Franck, Max a další

Zdroj: SEA

Témata: ta113, FOS: Computer and information sciences, sublinear algorithms, engineering, Sublinear Algorithms, Algorithm Engineering, 0102 computer and information sciences, 01 natural sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Algorithm , algorithmic graph theory, Algorithmic Graph Theory

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2103.15703
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.1
https://aaltodoc.aalto.fi/handle/123456789/118483
https://aaltodoc.aalto.fi/handle/123456789/108573

QCSP on Reflexive Tournaments

Autoři: Benoît Larose Barnaby Martin Petar Marković a další

Přispěvatelé: Benoît Larose Barnaby Martin Petar Marković a další

Zdroj: The 29th Annual European Symposium on Algorithms (ESA 2021), Lisbon / Online, 6-8 Sept 2021 [Conference proceedings]
ACM Transactions on Computational Logic, 2022, Vol.23(3), pp.1-22 [Peer Reviewed Journal]
European Symposium on Algorithms
ACM Transaction on Computational Logic

Témata: FOS: Computer and information sciences, logic, computational complexity, constraint satisfaction, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Constraint satisfaction, Universal algebra, Computational Complexity (cs.CC), 01 natural sciences, Algorithmic graph theory, Computational complexity, Computer Science - Computational Complexity, quantified constraints, universal algebra, ddc:004, 0101 mathematics, algorithmic graph theory, graph theorem, Quantified constraints

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2104.10570
https://dblp.uni-trier.de/db/journals/corr/corr2104.html#abs-2104-10570
https://drops.dagstuhl.de/opus/volltexte/2021/14639/pdf/LIPIcs-ESA-2021-58.pdf/
https://dro.dur.ac.uk/33667/
https://drops.dagstuhl.de/opus/volltexte/2021/14639/
https://arxiv.org/abs/2104.10570
https://ora.ox.ac.uk/objects/uuid:b99ea8d1-d391-4314-b0ec-5090bd33b5ee
https://doi.org/10.1145/3508069
https://ora.ox.ac.uk/objects/uuid:cc71d348-e977-4746-9714-b6cfa88d8f56
https://doi.org/10.4230/lipics.esa.2021.58
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.58
http://dro.dur.ac.uk/33667/
http://dro.dur.ac.uk/33667/1/33667.pdf
https://doi.org/10.4230/LIPIcs.ESA.2021.58
http://dro.dur.ac.uk/34958/1/34958.pdf
https://doi.org/10.1145/3508069
http://dro.dur.ac.uk/34958/

Vertex connectivity in poly-logarithmic max-flows

Autoři: Li, Jason Na Nongkai, Danupon Panigrahi, Debmalya a další

Zdroj: Proceedings of the Annual ACM Symposium on Theory of Computing Proceedings of the annual ACM Symposium on Theory of Computing. :317-329

Témata: algorithmic graph theory, vertex connectivity, Max flow algorithm, Running time, Time algorithms, Time bound, Undirected graph, Computation theory

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-309938
https://doi.org/10.1145/3406325.3451088

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous

Autoři: Dogeas, Konstantinos Erlebach, Thomas Kammer, Frank a další

Přispěvatelé: Dogeas, Konstantinos Erlebach, Thomas Kammer, Frank a další

Témata: dynamic graphs, parameterized algorithms, algorithmic graph theory, graph automorphism, orbit number

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.55

Dostupnost: https://doi.org/10.4230/LIPIcs.ICALP.2024.55
https://nbn-resolving.org/urn:nbn:de:0030-drops-201989
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.55

Assisted Normative Reasoning with Aristotelian Diagrams

Autoři: Kathrin Hanauer Tereza Novotná Matteo Pascucci

Zdroj: Frontiers in Artificial Intelligence and Applications ISBN: 9781643684727

Témata: 102031 Theoretische Informatik, normative reasoning, 102031 Theoretical computer science, assisted reasoning, Aristotelian diagrams, Algorithmic graph theory, automated deduction

Přístupová URL adresa: https://ucrisportal.univie.ac.at/de/publications/ba7c497b-5275-4952-897b-869f9a8a7a1f
https://doi.org/10.3233/FAIA230949

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous

Autoři: Dogeas, Konstantinos Erlebach, Thomas Kammer, Frank a další

Přispěvatelé: Dogeas, Konstantinos Erlebach, Thomas Kammer, Frank a další

Témata: orbit number, FOS: Computer and information sciences, parameterized algorithms, graph automorphism, dynamic graphs, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, algorithmic graph theory

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2312.07140
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.55

MAYGEN: an open-source chemical structure generator for constitutional isomers based on the orderly generation principle

Autoři: Mehmet Aziz Yirik Maria Sorokina Christoph Steinbeck

Zdroj: Journal of Cheminformatics, Vol 13, Iss 1, Pp 1-14 (2021)

Témata: Constitutional isomer generation, Algorithmic group theory, Algorithmic graph theory, Chemical graph generation, Open-source software, CDK, Information technology, T58.5-58.64, Chemistry, QD1-999

Popis souboru: electronic resource

Relation: https://doaj.org/toc/1758-2946

Přístupová URL adresa: https://doaj.org/article/9f7ac76dd80144bbb2f4de7e41183ed5

Algorithmic Graph Theory, Reinforcement Learning and Game Theory in MD Simulations: From 3D Structures to Topological 2D-Molecular Graphs (2D-MolGraphs) and Vice Versa

Autoři: Bougueroua, Sana Bricage, Marie Aboulfath, Ylène a další

Přispěvatelé: Bougueroua, Sana Bricage, Marie Aboulfath, Ylène a další

Zdroj: ISSN: 1420-3049 ; Molecules ; https://hal.science/hal-04122841 ; Molecules, 2023, 28 (7), pp.2892. ⟨10.3390/molecules28072892⟩.

Témata: game theory, identification of conformers, machine learning, molecular dynamics, pathways, prediction of 3D structures, conformational conversion, algorithmic graph theory, [CHIM]Chemical Sciences

Relation: info:eu-repo/semantics/altIdentifier/pmid/37049654; PUBMED: 37049654

Dostupnost: https://hal.science/hal-04122841
https://hal.science/hal-04122841v1/document
https://hal.science/hal-04122841v1/file/Algorithmic%20Graph%20Theory,%20Reinforcement%20Learning%20and%20Game%20Theory%20in%20MD%20Simulations%20From%203D%20Structures%20to%20Topological%202D-Molecular%20Graphs%20%282D-MolGraphs%29%20and%20Vice%20Versa.pdf
https://doi.org/10.3390/molecules28072892

Quasi-Polynomial Time Techniques for Independent Set and Beyond in Hereditary Graph Classes

Autoři: Gartland, Peter

Témata: Computer science, Mathematics, Algorithmic Graph Theory, Algorithms, Graph Theory, Independent Set

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/0kk6d2jv
https://escholarship.org/content/qt0kk6d2jv/qt0kk6d2jv.pdf

Preface of STACS 2019 Special Issue

Autoři: Niedermeier, Rolf Paul, Christophe

Zdroj: Theory of Computing Systems. 65:635-637

Témata: distributed algorithms, 510 Mathematik, computer science, 0102 computer and information sciences, ddc:510, algorithmic graph theory, linear dynamical systems, automata theory, 01 natural sciences, parameterized complexity analysis

Popis souboru: application/pdf

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007/s00224-020-10026-5.pdf
https://dblp.uni-trier.de/db/journals/mst/mst65.html#NiedermeierP21
https://link.springer.com/content/pdf/10.1007/s00224-020-10026-5.pdf
https://depositonce.tu-berlin.de/handle/11303/13368
https://depositonce.tu-berlin.de/bitstream/11303/13368/2/Niedermeier_Paul_Preface_2021.pdf
https://link.springer.com/article/10.1007/s00224-020-10026-5
https://depositonce.tu-berlin.de/handle/11303/13368

Surjective H-Colouring over Reflexive Digraphs

Autoři: Larose, B. Martin, B. Paulusma, D. a další

Přispěvatelé: Larose, B. Martin, B. Paulusma, D. a další

Zdroj: ACM transactions on computation theory, 2018, Vol.11(1), pp.3 [Peer Reviewed Journal]
Niedermeier, Rolf & Vallée, Brigitte (Eds.). (2018). 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) : February 28–March 3, 2018, Caen, France. Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 49:1-49:14, Leibniz International Proceedings in Informatics (LIPIcs)(96)

Témata: FOS: Computer and information sciences, Computational Complexity, 0102 computer and information sciences, Computational Complexity (cs.CC), 16. Peace & justice, 01 natural sciences, Computer Science - Computational Complexity, Surjective H-Coloring, Universal Algebra, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), ddc:004, Algorithmic Graph Theory, Constraint Satisfaction

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2018/8488/pdf/LIPIcs-STACS-2018-49.pdf
http://arxiv.org/abs/1709.09486
https://dblp.uni-trier.de/db/journals/corr/corr1709.html#abs-1709-09486
https://dro.dur.ac.uk/26147/
https://dl.acm.org/doi/10.1145/3282431
https://drops.dagstuhl.de/opus/volltexte/2018/8488/pdf/LIPIcs-STACS-2018-49.pdf/
https://arxiv.org/abs/1709.09486
https://drops.dagstuhl.de/opus/volltexte/2018/8488/
https://dl.acm.org/doi/abs/10.1145/3282431
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.49
http://dro.dur.ac.uk/26147/1/26147.pdf
https://doi.org/10.1145/3282431
http://dro.dur.ac.uk/26147/
http://drops.dagstuhl.de/opus/volltexte/2018/8488/
http://dro.dur.ac.uk/24227/
http://dro.dur.ac.uk/24227/1/24227.pdf

Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs

Autoři: Gupta, Chetan Jain, Rahul Tewari, Raghunath a další

Přispěvatelé: Gupta, Chetan Jain, Rahul Tewari, Raghunath a další

Témata: Graph algorithms, space-bounded algorithms, surface embedded graphs, reachability, Euler genus, algorithmic graph theory, computational complexity theory

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 213, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.23

Dostupnost: https://doi.org/10.4230/LIPIcs.FSTTCS.2021.23
https://nbn-resolving.org/urn:nbn:de:0030-drops-155344
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.23

QCSP on Reflexive Tournaments

Autoři: Larose, Benoît Marković, Petar Martin, Barnaby a další

Přispěvatelé: Larose, Benoît Marković, Petar Martin, Barnaby a další

Témata: computational complexity, algorithmic graph theory, quantified constraints, universal algebra, constraint satisfaction

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.58

Dostupnost: https://doi.org/10.4230/LIPIcs.ESA.2021.58
https://nbn-resolving.org/urn:nbn:de:0030-drops-146392
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.58

Cutting-Edge Algorithms for Monotone Graph Classes

Autoři: Pandey, Sukanya Bodlaender, H.L. Leeuwen, E.J. van

Přispěvatelé: Pandey, Sukanya Bodlaender, H.L. Leeuwen, E.J. van

Témata: Graph Theory, Structural Graph Theory, Algoritmen, Algorithm Design, Graafklassen, Graph Classes, Parameterized Complexity, Algorithmic Graph Theory

Popis souboru: image/pdf

Přístupová URL adresa: https://dspace.library.uu.nl/handle/1874/456617

Space-constrained algorithm for computing separators in surface-embedded graphs *

Autoři: Gupta, Chetan Jain, Rahul Tewari, Raghunath a další

Přispěvatelé: Gupta, Chetan Jain, Rahul Tewari, Raghunath a další

Zdroj: https://hal.science/hal-04168607 ; 2023.

Témata: Graph algorithms analysis, graph theory, Graph algorithms, space-bounded algorithms, surface embedded graphs, reachability, Euler genus, algorithmic graph theory, computational complexity theory, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Relation: hal-04168607; https://hal.science/hal-04168607; https://hal.science/hal-04168607/document; https://hal.science/hal-04168607/file/main.pdf

Dostupnost: https://hal.science/hal-04168607
https://hal.science/hal-04168607/document
https://hal.science/hal-04168607/file/main.pdf