Výsledky vyhledávání - Mathematics of computing-Graph algorithms
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: Algorithmica. 87:1199-1221
Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, perfect matching, H-free graph, 0102 computer and information sciences, [INFO] Computer Science [cs], Computational Complexity (cs.CC), 01 natural sciences, girth, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, matching cut, Computer Science - Discrete Mathematics
Popis souboru: application/pdf
-
2
Autoři: a další
Přispěvatelé: a další
Zdroj: ACM Transactions on the Web. 19:1-19
Témata: Coordinated Inauthentic Behaviour, Network algorithms, Mathematics of computing, Graph algorithms. Trees, Influence, Coordinated Inauthentic Behaviour, Computer Science - Computers and Society, Physics - Physics and Society, Influence, Network algorithms, Computer Science - Social and Information Networks, Mathematics of computing, Graph algorithms. Trees
Popis souboru: application/pdf; ELETTRONICO
-
3
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
-
4
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
-
5
Autoři: a další
Přispěvatelé: a další
Zdroj: 29th Annual European Symposium on Algorithms (ESA 2021)
Témata: 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 souboru: application/pdf
Pří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 -
6
Autoři: a další
Přispěvatelé: a další
Zdroj: ACM Transactions on Computation Theory. 16:1-18
Témata: 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 souboru: application/pdf
-
7
Autoři: a další
Přispěvatelé: a další
Zdroj: 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Témata: 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 souboru: application/pdf
Pří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 -
8
Autoři: a další
Přispěvatelé: a další
Zdroj: SIAM Journal on Discrete Mathematics. 37:2585-2616
Témata: FOS: Computer and information sciences, Computer Science - Machine Learning, Discrete Mathematics (cs.DM), Theory of computation → Machine learning theory, Mathematics of computing → Graph algorithms, 0102 computer and information sciences, 01 natural sciences, Machine Learning (cs.LG), Proper Sample Compression Schemes, VC-dimension, Balls, ddc:004, 0101 mathematics, Graphs, Computer Science - Discrete Mathematics
Popis souboru: application/pdf
-
9
Autoři:
Zdroj: Discrete Applied Mathematics. 129:449-460
Témata: Rotagraph, Dynamic algorithm, Cartesian product of graphs, \((2,1)\)-coloring, Applied Mathematics, dynamic algorithm, 0102 computer and information sciences, strong product of graphs, 01 natural sciences, Coloring of graphs and hypergraphs, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), rotagraph, (2,1)-coloring, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, Independence number, Discrete Mathematics and Combinatorics, Strong product of graphs, independence number
Popis souboru: application/xml
Přístupová URL adresa: https://zbmath.org/1977910
https://doi.org/10.1016/s0166-218x(02)00597-8 -
10
Autoři:
Zdroj: Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, February, Leibniz International Proceedings in Informatics : LIPIcs 326, 13:1-13:22 (2025). doi:10.4230/LIPIcs.CSL.2025.13 ; 33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz ; 33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz 33. EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, Netherlands, 2025-02-10 - 2025-02-14
Témata: Mathematics of computing → Graph algorithms, Theory of computation → Complexity theory and logic, Theory of computation → Problems, reductions and completeness, Weisfeiler-Leman algorithm, coherent configurations, complexity, dimension
Geografické téma: DE
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-362-1; info:eu-repo/grantAgreement/EC//101054974
-
11
Autoři: a další
Přispěvatelé: a další
Témata: 102031 Theoretische Informatik, Mathematics of computing → Graph algorithms, 102031 Theoretical computer science, Networks → Network dynamics, survey, ddc:004, General and reference → Surveys and overviews, fully dynamic graph algorithms
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.1
-
12
Autoři: a další
Přispěvatelé: a další
Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Data structures, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Fixed-parameter algorithms and complexity, Mathematics - Logic, 0102 computer and information sciences, Theory of computation → Finite Model Theory, 01 natural sciences, Logic in Computer Science (cs.LO), Theory of computation → Fixed parameter tractability, Computational applications of logic, Computer Science - Data Structures and Algorithms, Combinatorics and graph theory, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Logic (math.LO), Graph algorithms, Computer Science - Discrete Mathematics
Popis souboru: application/pdf
-
13
Autoři: a další
Přispěvatelé: a další
Zdroj: Algorithmica
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021Témata: 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 souboru: application/pdf
-
14
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
-
15
Autoři: a další
Přispěvatelé: a další
Zdroj: Algorithmica. 84:3110-3155
Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, NP-hard, 01 natural sciences, width parameters, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Graph algorithms, parameterized complexity, Computer Science - Discrete Mathematics
Popis souboru: application/pdf
-
16
Autoři:
Zdroj: Journal of Parallel and Distributed Computing. 69:750-761
Témata: ddc:004, DATA processing & computer science, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0101 mathematics, 01 natural sciences
Přístupová URL adresa: http://parco.iti.uni-karlsruhe.de/henningm/data/JPDC09.pdf
-
17
Autoři: a další
Zdroj: Journal of the ACM; Feb2025, Vol. 72 Issue 1, p1-50, 50p
-
18
Autoři: a další
Přispěvatelé: a další
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⟩Témata: 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
-
19
Autoři: a další
Přispěvatelé: a další
Zdroj: Leibniz international proceedings in informatics, 187
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)Témata: 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 souboru: application/pdf; 1 full-text file(s): application/pdf
Pří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 -
20
Autoři: a další
Přispěvatelé: a další
Zdroj: Saarbrücken/Wadern, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, February, Leibniz International Proceedings in Informatics : LIPIcs 326, 13:1-13:22 (2025). doi:10.4230/LIPIcs.CSL.2025.13
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz33. EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, Netherlands, 2025-02-10-2025-02-14Témata: FOS: Computer and information sciences, Weisfeiler-Leman algorithm, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Theory of computation → Problems, reductions and completeness, coherent configurations, Computational Complexity (cs.CC), Computer Science - Computational Complexity, dimension, ddc:004, Theory of computation → Complexity theory and logic, complexity, Computer Science - Discrete Mathematics
Popis souboru: application/pdf
Full Text Finder 
Nájsť tento článok vo Web of Science