Výsledky vyhľadávania - "Mathematics of computing → Graph theory"
-
1
Autori: a ďalší
Prispievatelia: 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
-
2
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Leibniz International Proceedings in Informatics
58:1-58:8Predmety: FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), 4. Education, 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences, hereditary graph class, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Minimal separator, 0101 mathematics, Computer Science - Discrete Mathematics
Popis súboru: application/pdf
-
3
Autori:
Zdroj: Computer Graphics Forum. 44
Predmety: FOS: Computer and information sciences, Computer Science - Machine Learning, CCS Concepts, • Computing methodologies → Dimensionality reduction and manifold learning, • Mathematics of computing → Graph theory, • Human-centered computing → Visualization, Machine Learning (cs.LG)
Prístupová URL adresa: http://arxiv.org/abs/2412.06555
-
4
Autori: a ďalší
Predmety: ddc:004, Mathematics of computing → Graph theory, Stack Number, Separated linear Layouts, DATA processing & computer science, Queue Number, bipartite Graphs, mixed Number, Mathematics of computing → Combinatorics
Popis súboru: application/pdf
-
5
Autori: a ďalší
Predmety: ddc:004, Mathematics of computing → Graph theory, DATA processing & computer science, linear Layout, Stack Layout, Ordered Graphs, Queue Layout, mixed linear Layout
Popis súboru: application/pdf
-
6
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; Symposium on Algorithmic Foundations of Dynamic Networks (SAND) ; https://normandie-univ.hal.science/hal-05283832 ; Symposium on Algorithmic Foundations of Dynamic Networks (SAND), Jun 2025, LIVERPOOL, United Kingdom. ⟨10.4230/LIPIcs.SAND.2025.2⟩
Predmety: Mathematics of computing → Graph theory, Temporal Graph Exploration, Graph Theory, Temporal Graph Exploration Digital Object Identifier 10.4230/LIPIcs.SAND.2025.2, Temporal Graph, 2012 ACM Subject Classification Mathematics of computing → Graph theory Graph Theory, 2012 ACM Subject Classification Mathematics of computing → Graph theory Graph Theory Temporal Graph Temporal Graph Exploration Digital Object Identifier 10.4230/LIPIcs.SAND.2025.2, [INFO]Computer Science [cs], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]
Geografické téma: LIVERPOOL, United Kingdom
-
7
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Discrete Comput Geom
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Universidad de Zaragoza
instnamePredmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, Mathematics of computing → Graph theory, plane matching, Simple drawings, 0102 computer and information sciences, Mathematics of computing → Combinatorics, 01 natural sciences, simple topological graphs, Article, disjoint edges, Computer Science - Computational Geometry, ddc:004, plane path
Popis súboru: application/pdf
-
8
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Journal of Combinatorial Theory, Series B. 160:15-35
Predmety: Linear rank-width, path-width, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width matroid linear rank-width graph forbidden minor vertex-minor pivot-minor, 0102 computer and information sciences, 01 natural sciences, Graph, forbidden minor, FOS: Mathematics, Vertex-minor, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases path-width, pivot-minor, Matroid, linear rank-width, Pivot-minor, graph, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Path-width, Combinatorics, vertex-minor, Forbidden minor, matroid, Combinatorics (math.CO), ddc:004, Recherche opérationnelle, 05B35 (Primary), 05C75 (Secondary)
Popis súboru: application/pdf
Prístupová URL adresa: http://arxiv.org/abs/2109.12291
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.40
https://hal.science/hal-04056695v1
https://doi.org/10.1016/j.jctb.2022.12.004
https://hal.science/hal-04056545v2/document
https://hal.science/hal-04056545v2
https://doi.org/10.4230/lipics.stacs.2022.40 -
9
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: https://normandie-univ.hal.science/hal-05020820 ; LITIS, Le Havre Normandie University. 2025.
Predmety: Temporal graph, Graph exploration, Graph Theory, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases Graph Exploration Graph Theory Temporal Graph, 2012 ACM Subject Classification Mathematics of computing → Graph theory phrases Graph Exploration, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]
-
10
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Roberson, D E & Seppelt, T 2024, ' Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability ', TheoretiCS, vol. 3, 20 . https://doi.org/10.46298/theoretics.24.20
Roberson, D E & Seppelt, T 2023, Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability . in Proceedings of the 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) . vol. 261, 101, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, pp. 101:1-101:18, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), Paderborn, North Rhine-Westphalia, Germany, 10/07/2023 . https://doi.org/10.4230/LIPIcs.ICALP.2023.101
Roberson, D E & Seppelt, T 2023, Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability . in K Etessami, U Feige & G Puppis (eds), 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023 ., 101, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, LIPIcs, vol. 261, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, Paderborn, Germany, 10/07/2023 . https://doi.org/10.4230/LIPIcs.ICALP.2023.101
Dagstuhl, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics 261, 101:1-101:18 (2023). doi:10.4230/LIPICS.ICALP.2023.101
50th International Colloquium on Automata, Languages and Programming (ICALP 2023) / Herausgeber: Kousha Etessami, Uriel Feige, Gabriele Puppis
50th International Colloquium on Automata, Languages and Programming (ICALP 2023) / Herausgeber: Kousha Etessami, Uriel Feige, Gabriele Puppis50. International Colloquium on Automata, Languages and Programming, ICALP 2023, Paderborn, Germany, 2023-07-10-2023-07-14
TheoretiCS : an open access journal in theoretical computer science 3, 12321 (2024). doi:10.46298/theoretics.24.20
42 Seiten (2023). doi:10.48550/ARXIV.2302.10538
TheoretiCSPredmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Discrete Mathematics (cs.DM), Treewidth, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Graph isomorphism, Homomorphism indistinguishability, Linear programming, FOS: Mathematics, treewidth, Mathematics - Combinatorics, Semidefinite programming, Mathematics - Optimization and Control, Lasserre hierarchy, graph isomorphism, Mathematics of computing → Graph theory, linear programming, semidefinite programming, Mathematics of computing → Combinatorics, Logic in Computer Science (cs.LO), Computer Science - Computational Complexity, Optimization and Control (math.OC), Sherali–Adams hierarchy, homomorphism indistinguishability, Combinatorics (math.CO), ddc:004, Sherali-Adams hierarchy, Computer Science - Discrete Mathematics
Popis súboru: application/pdf
Prístupová URL adresa: http://arxiv.org/abs/2302.10538
https://orbit.dtu.dk/en/publications/fb2ad2b2-79a1-4dd4-89d9-c1db18db5340
https://orbit.dtu.dk/en/publications/7a8177cd-cdb4-4e46-8018-3012bdcc3350
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.101
https://curis.ku.dk/ws/files/362936484/Lasserre_Hierarchy.pdf
https://publications.rwth-aachen.de/record/960915
https://publications.rwth-aachen.de/record/992330
https://publications.rwth-aachen.de/record/992617 -
11
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Lecture Notes in Computer Science ISBN: 9783031159138
Bekos, M.A. & Kaufmann, M. (Eds.). Graph-Theoretic Concepts in Computer Science. WG 2022. : Springer, pp. 114-128, Lecture Notes in Computer Science, Vol.13453Predmety: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), fracture number, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Computational Complexity (cs.CC), 01 natural sciences, (locally constrained) graph homomorphism parameterized complexity fracture number, integer linear programming, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), parameterized complexity, role assignment, 2012 ACM Subject Classification Mathematics of computing → Graph theory locally constrained homomorphism, deletion set/modulator to small components, 2012 ACM Subject Classification Mathematics of computing → Graph theory locally constrained homomorphism parameterized complexity deletion set/modulator to small components role assignment integer linear programming, Computer Science - Computational Complexity, Combinatorics (math.CO), Recherche opérationnelle, (locally constrained) graph homomorphism, Computer Science - Discrete Mathematics
Popis súboru: application/pdf
-
12
Autori:
Prispievatelia:
Zdroj: Saarbrücken/Wadern, Germany : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 306, 6:1-6:18 (2024). doi:10.4230/LIPICS.MFCS.2024.6
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-30Predmety: FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), treedepth, G.2.2, cops-and-robber game, monotonicity, 16. Peace & justice, treewidth, FOS: Mathematics, Mathematics - Combinatorics, homomorphism distinguishing closure, Combinatorics (math.CO), ddc:004, tree decompositions, Computer Science - Discrete Mathematics
Popis súboru: application/pdf
-
13
Autori:
Prispievatelia:
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 SciencePredmety: 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
-
14
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Theory of computation → Models of computation, Mathematics of computing → Graph theory, STACS 2024, Theory of computation → Design and analysis of algorithms, Theory of computation → Formal languages and automata theory, Complete Volume, [INFO] Computer Science [cs], Volume 289, Theory of computation → Computational complexity and cryptography, Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs
Prístupová URL adresa: https://hal.science/hal-04859229v1
-
15
Autori:
Prispievatelia:
Predmety: Mathematics of computing → Graph theory, algorithmic graph structure theory, monadic second-order logic, [INFO] Computer Science [cs], ddc:004, Theory of computation → Finite Model Theory, Algorithmic meta theorems, first-order logic, disjoint paths logic
Popis súboru: application/pdf
-
16
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Unit Interval Graphs, FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), Characterization, [INFO] Computer Science [cs], Computer Science - Data Structures and Algorithms, Interval graphs, Multiple Interval Graphs, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics
Popis súboru: application/pdf
-
17
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: European Association for Theoretical Computer Science (EATCS) ; ICALP 2024 51st EATCS International Colloquium on Automata, Languages and Programming ; https://hal.science/hal-04632835 ; ICALP 2024 51st EATCS International Colloquium on Automata, Languages and Programming, European Association for Theoretical Computer Science (EATCS), Jul 2024, Tallinn, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.36⟩
Predmety: k-pairability, Theory of computation → Quantum information theory, Theory of computation → Quantum communication complexity, Mathematics of computing → Graph theory, vertex-minors, graph states, Quantum networks, [INFO]Computer Science [cs], [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph]
Time: Tallinn, Estonia
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2402.06260; info:eu-repo/grantAgreement//101018180/EU/High Performance Computer and Quantum Simulator hybrid/HPCQS; ARXIV: 2402.06260
-
18
Autori: a ďalší
Zdroj: Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Leibniz International Proceedings in Informatics : LIPIcs 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19 ; 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024) ; 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024) 41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11 - 2024-03-15
Predmety: Mathematics of computing → Graph theory, Theory of computation → Graph algorithms analysis, Theory of computation → Parameterized complexity and exact algorithms, counting complexity, graph homomorphism, parameterised complexity
Geografické téma: DE
Relation: info:eu-repo/semantics/altIdentifier/issn/1868-8969; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-311-9; info:eu-repo/semantics/altIdentifier/wos/WOS:001300393400019; info:eu-repo/grantAgreement/EC//101054974
-
19
Autori:
Zdroj: Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 288, 27:[1]-27:17 (2024). doi:10.4230/LIPIcs.CSL.2024.27 ; 32nd EACSL Annual Conference on Computer Science Logic : CSL 2024, February 19–23, 2024, Naples, Italy / edited by Aniello Murano Alexandra Silva ; 32nd EACSL Annual Conference on Computer Science Logic : CSL 2024, February 19–23, 2024, Naples, Italy / edited by Aniello Murano Alexandra Silva 32. EACSL Annual Conference on Computer Science Logic, CSL 2024, Naples, Italy, 2024-02-19 - 2024-02-23
Predmety: Mathematics of computing → Graph theory, Theory of computation → Finite Model Theory, Treewidth, counting first-order logic, homomorphism indistinguishability, treedepth
Geografické téma: DE
Relation: info:eu-repo/semantics/altIdentifier/issn/1868-8969; info:eu-repo/semantics/altIdentifier/wos/WOS:001300390800027; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-310-2; info:eu-repo/grantAgreement/EC//101054974
-
20
Autori:
Prispievatelia:
Zdroj: Information and computation 301(Part A), 105224 (2024). doi:10.1016/j.ic.2024.105224 special issue: "Special issue on the 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) / Guest Editors: Dr. Jérôme Leroux, Professor David Peleg"
48. International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, Bordeaux, France, 2023-08-28-2023-09-01
Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics: LIPIcs 272, 82:1-82:15 (2023). doi:10.4230/LIPIcs.MFCS.2023.82
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) / Herausgeber: Jérôme Leroux, Sylvain Lombardy, David Peleg
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) / Herausgeber: Jérôme Leroux, Sylvain Lombardy, David Peleg48. International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, Bordeaux, France, 2023-08-28-2023-09-01
Information and ComputationPredmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, logic, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Mathematics of computing → Combinatorics, graph minor, Logic in Computer Science (cs.LO), Computer Science - Computational Complexity, FOS: Mathematics, Mathematics - Combinatorics, homomorphism indistinguishability, Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
Popis súboru: application/pdf
Full Text Finder 
Nájsť tento článok vo Web of Science