Výsledky vyhledávání - Mathematics of computing Discrete mathematics Graph theory
-
1
Autoři:
Zdroj: Carpathian Journal of Mathematics, 2011 Jan 01. 27(2), 153-164.
Přístupová URL adresa: https://www.jstor.org/stable/43997684
-
2
Autoři: Eppstein, David
Zdroj: DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE. 26(3)
Témata: confluent graph drawing, clique-width, twin-width, Mathematical Sciences, Information and Computing Sciences, Computation Theory & Mathematics, Information and computing sciences, Mathematical sciences
Přístupová URL adresa: https://escholarship.org/uc/item/9zh0132v
-
3
Predictions of first passage times in sparse discrete fracture networks using graph-based reductions
Přispěvatelé: Viswanathan, Hari [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)] (ORCID:0000000211789647)
Zdroj: Physical Review E; 96; 1
Popis souboru: Medium: ED; Size: 013304
Přístupová URL adresa: http://www.osti.gov/scitech/servlets/purl/1374351
-
4
Autoři: a další
Přístupová URL adresa: https://hdl.handle.net/10807/217004
-
5
Autoři: a další
Přispěvatelé: a další
Zdroj: Leibniz International Proceedings in Informatics
58:1-58:8Témata: 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 souboru: application/pdf
-
6
Autoři: a další
Přispěvatelé: a další
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)Témata: 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 souboru: application/pdf
-
7
Autoři: Monsó Burgués, Enrique P.J.
Přispěvatelé: University/Department: Universitat Politècnica de Catalunya. Facultat de Matemàtiques i Estadística
Thesis Advisors: Carmona Mejías, Ángeles, Mitjana Riera, Margarida
Zdroj: TDX (Tesis Doctorals en Xarxa)
Popis souboru: application/pdf
Přístupová URL adresa: http://hdl.handle.net/10803/690033
https://dx.doi.org/10.5821/dissertation-2117-402158 -
8
Autoři: a další
Přispěvatelé: a další
Zdroj: ACM Transactions on Algorithms
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)Témata: 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 souboru: application/pdf
Pří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 -
9
Autoři: a další
Přispěvatelé: a další
Zdroj: Journal of Combinatorial Theory, Series B. 160:15-35
Témata: 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 souboru: application/pdf
Pří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 -
10
Autoři: a další
Přispěvatelé: a další
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
TheoretiCSTémata: 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 souboru: application/pdf
Pří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
Autoři: a další
Přispěvatelé: a další
Témata: 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 souboru: application/pdf
-
12
Autoři: a další
Přispěvatelé: a další
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.13453Témata: 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 souboru: application/pdf
-
13
Autoři: a další
Přispěvatelé: a další
Témata: FOS: Computer and information sciences, entanglement: quantum, Quantum Physics, k-pairability, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), Theory of computation → Quantum communication complexity, vertex-minors, FOS: Physical sciences, graph states, stability, [INFO] Computer Science [cs], Quantum networks, [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph], Theory of computation → Quantum information theory, quantum state, graph state, [INFO]Computer Science [cs], ddc:004, Quantum Physics (quant-ph), qubit, [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph], Computer Science - Discrete Mathematics
Popis souboru: application/pdf
-
14
Autoři: a další
Přispěvatelé: a další
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 Silva32. EACSL Annual Conference on Computer Science Logic, CSL 2024, Naples, Italy, 2024-02-19-2024-02-23
32nd EACSL Annual Conference on Computer Science Logic : CSL 2024, February 19–23, 2024, Naples, Italy / edited by Aniello Murano, Alexandra SilvapagesTémata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Mathematics of computing → Graph theory, counting first-order logic, Discrete Mathematics (cs.DM), Treewidth, treedepth, homomorphism indistinguishability, ddc:004, Theory of computation → Finite Model Theory, Computer Science - Discrete Mathematics, Logic in Computer Science (cs.LO)
Popis souboru: application/pdf
-
15
Autoři:
Přispěvatelé:
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 ScienceTémata: 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 souboru: application/pdf
-
16
Autoři: a další
Zdroj: SIAM Journal on Discrete Mathematics. 38(3)
Témata: Theory Of Computation, Applied Mathematics, Information and Computing Sciences, Pure Mathematics, Mathematical Sciences, Computation Theory and Mathematics, Computation Theory & Mathematics, Theory of computation, Applied mathematics, Pure mathematics
Přístupová URL adresa: https://escholarship.org/uc/item/2z3410hc
-
17
Autoři:
Přispěvatelé:
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-30Témata: 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 souboru: application/pdf
-
18
Autoři:
Přispěvatelé:
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 ComputationTémata: 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 souboru: application/pdf
-
19
Autoři: a další
Zdroj: Swedish e-Science Research Centre 2019 IEEE 9th Symposium on Large Data Analysis and Visualization, LDAV 2019. :42-51
Témata: Computing methodologies, Discrete mathematics, Distributed algorithms, Distributed computing methodologies, Graph theory, Mathematics of computing, Paths and connectivity problems, Datalogi, Computer Science, SRA - E-Science (SeRC), SRA - E-vetenskap (SeRC)
Popis souboru: electronic
-
20
Autoři: a další
Přispěvatelé: a další
Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, [INFO.INFO-DC]Computer Science [cs]/Distributed, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), Computing methodologies → Distributed computing methodologies, proof labeling schemes, Theory of computation → Computational geometry, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], Parallel, and Cluster Computing [cs.DC], Computer Science - Distributed, Parallel, and Cluster Computing, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], geometric intersection graphs, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Local certification, FOS: Mathematics, Computer Science - Computational Geometry, Mathematics - Combinatorics, Distributed, Parallel, and Cluster Computing (cs.DC), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics
Popis souboru: application/pdf
Nájsť tento článok vo Web of Science 
Full Text Finder