Search Results - "Mathematics of computing → Graph algorithms"
-
1
Authors: et al.
Contributors: et al.
Source: Algorithmica. 87:1199-1221
Subject Terms: 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
File Description: application/pdf
-
2
Authors: et al.
Contributors: et al.
Source: ACM Transactions on the Web. 19:1-19
Subject Terms: 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
File Description: application/pdf; ELETTRONICO
-
3
Authors: et al.
Contributors: et al.
Source: ACM Transactions on Computation Theory. 16:1-18
Subject Terms: 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
File Description: application/pdf
-
4
Authors: et al.
Contributors: et al.
Source: SIAM Journal on Discrete Mathematics. 37:2585-2616
Subject Terms: 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
File Description: application/pdf
-
5
Authors:
Source: 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
Subject Terms: 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
Subject Geographic: DE
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-362-1; info:eu-repo/grantAgreement/EC//101054974
-
6
Authors: et al.
Contributors: et al.
Source: 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⟩Subject Terms: 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]
Subject Geographic: Bratislava, Slovakia
-
7
Authors: et al.
Contributors: et al.
Source: Algorithmica. 84:3110-3155
Subject Terms: 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
File Description: application/pdf
-
8
Authors: et al.
Contributors: et al.
Source: Algorithmica
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021Subject Terms: 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
File Description: application/pdf
-
9
Authors: et al.
Contributors: et al.
Source: Leibniz International Proceedings in Informatics
Subject Terms: ddc:004, Branch-and-Reduce, Computing methodologies → Neural networks, Mathematics of computing → Graph algorithms, DATA processing & computer science, Independent Set, Vertex Cover, Graph Neural Networks, Graphs
File Description: application/pdf
-
10
Authors: et al.
Contributors: et al.
Source: 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-14Subject Terms: 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
File Description: application/pdf
-
11
Authors: et al.
Contributors: et al.
Subject Terms: FOS: Computer and information sciences, separation, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, monophonic convexity, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Mathematics of computing → Paths and connectivity problems, Computer Science - Data Structures and Algorithms, FOS: Mathematics, half-space, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, chordless paths, Computer Science - Discrete Mathematics
File Description: application/pdf
-
12
Authors: et al.
Contributors: et al.
Source: ITCS 2024 - 15th Innovations in Theoretical Computer Science Conference ; https://hal.science/hal-04691075 ; ITCS 2024 - 15th Innovations in Theoretical Computer Science Conference, Jan 2024, Berkeley, CA, United States. ⟨10.4230/LIPIcs.ITCS.2024.35⟩
Subject Terms: Collective exploration, Online algorithms, Evolving tree, Competitive analysis, Theory of computation → Online algorithms, Mathematics of computing → Graph algorithms, [INFO]Computer Science [cs]
Subject Geographic: Berkeley, CA, United States
-
13
Authors: et al.
Contributors: et al.
Source: Proceedings of the 13th International Conference on Web Search and Data Mining. :43-51
Subject Terms: [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI], 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, [INFO] Computer Science [cs], CCS CONCEPTS • Computing methodologies → Machine learning algorithms, scalability, • Mathematics of computing → Graph algorithms KEYWORDS Network embedding, real-world graph algorithms
File Description: application/pdf
Access URL: https://hal.archives-ouvertes.fr/hal-02999888/file/WSDM2020.pdf
http://dblp.uni-trier.de/db/conf/wsdm/wsdm2020.html#BhowmickMDGM20
https://hal.archives-ouvertes.fr/hal-02999888/document
https://hal.archives-ouvertes.fr/hal-02999888
https://dl.acm.org/doi/pdf/10.1145/3336191.3371800
https://hal.science/hal-02999888v1
https://doi.org/10.1145/3336191.3371800
https://hal.science/hal-02999888v1/document -
14
Authors:
Contributors:
Source: Saarbrücken/Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 297, 78:[1]-78:20 (2024). doi:10.4230/LIPICS.ICALP.2024.78
51st International Colloquium on Automata, Languages, and Programming : ICALP 2024, July 8–12, 2024, Tallinn, Estonia / edited by Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson
51st International Colloquium on Automata, Languages, and Programming : ICALP 2024, July 8–12, 2024, Tallinn, Estonia / edited by Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson51. International Colloquium on Automata, Languages, and Programming, ICALP 2024, Tallinn, Estonia, 2024-07-08-2024-07-12
Proceedings of the 51st International Colloquium on Automata, Languages, and ProgrammingSubject Terms: Weisfeiler-Leman algorithm, FOS: Computer and information sciences, twin width, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Theory of computation → Finite Model Theory, tournament isomorphism, Theory of computation → Fixed parameter tractability, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics
File Description: application/pdf
-
15
Authors:
Contributors:
Subject Terms: small classes, Mathematics of computing → Graph algorithms, NIP, Tournaments, twin-width, [MATH] Mathematics [math], [INFO] Computer Science [cs], Theory of computation → Finite Model Theory, model checking, Mathematics of computing → Graph enumeration, ddc:004, first-order logic
File Description: application/pdf
-
16
Authors: et al.
Contributors: et al.
Subject Terms: Monotonicity, Mathematics of computing → Graph algorithms, ddc:004, [INFO] Computer Science [cs], Graph Searching, Hunter and Rabbit
File Description: application/pdf
-
17
Authors: et al.
Contributors: et al.
Subject Terms: Mathematics of computing → Graph algorithms, Cops and Robber, Fixed parameter tractability, Theory of computation → Parameterized complexity and exact algorithms, Kernelization, ddc:004, Graph Searching
File Description: application/pdf
-
18
Authors:
Contributors:
Subject Terms: FOS: Computer and information sciences, Competitive analysis, online algorithms, collective exploration, Mathematics of computing → Graph algorithms, Online algorithms, [INFO] Computer Science [cs], Theory of computation → Online algorithms, evolving tree, Computer Science - Data Structures and Algorithms, competitive analysis, Computer Science - Multiagent Systems, Data Structures and Algorithms (cs.DS), ddc:004, Evolving tree, Collective exploration, Multiagent Systems (cs.MA)
File Description: application/pdf
-
19
Authors: et al.
Contributors: et al.
Subject Terms: FOS: Computer and information sciences, Hamiltonian cycle, Mathematics of computing → Graph algorithms, 16. Peace & justice, directed graphs, 7. Clean energy, longest path, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), ddc:004, directed feedback vertex set, parameterized complexity
File Description: application/pdf
-
20
Authors: et al.
Contributors: et al.
Subject Terms: Theory of computation → Dynamic graph algorithms, CMSO₂ formula, Mathematics of computing → Graph algorithms, fixed-parameter tractability, dynamic graphs, feedback vertex set, data structure, ddc:004
File Description: application/pdf
Full Text Finder 
Nájsť tento článok vo Web of Science