Výsledky vyhledávání - "ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory"
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: 41st International Symposium on Computational Geometry (SoCG 2025)
https://hal.science/hal-04654840
41st International Symposium on Computational Geometry (SoCG 2025), Jun 2025, Kanazawa, Japan. pp.23:1-23:16, ⟨10.4230/LIPIcs.SoCG.2025.23⟩Témata: computational topology, structural graph parameters, Whitney embedding theorem, twin-width, triangulations, MSC: 57Q15 (Primary) 57R05, 05C75, 57M15 (Secondary), ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.10174; ARXIV: 2407.10174
-
2
Autoři: a další
Přispěvatelé: a další
Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; 39th International Symposium on Computational Geometry (SoCG 2023) ; https://hal.science/hal-04055617 ; 39th International Symposium on Computational Geometry (SoCG 2023), Jun 2023, Dallas, United States. pp.42:1--42:18, ⟨10.4230/LIPIcs.SoCG.2023.42⟩
Témata: fixed-parameter tractability, generalized Heegaard splittings, JSJ decompositions, pathwidth, treewidth, triangulations, computational 3-manifold topology, MSC: 57Q15, 57N10, 05C75, 57M15, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Geografické téma: Dallas, United States
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2303.06789; ARXIV: 2303.06789
-
3
Autoři: a další
Přispěvatelé: a další
Zdroj: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications ; 12th European Conference on Combinatorics, Graph Theory and Applications ; https://hal.science/hal-04407011 ; 12th European Conference on Combinatorics, Graph Theory and Applications, Aug 2023, Prague, Czech Republic. pp.134-141, ⟨10.5817/CZ.MUNI.EUROCOMB23-019⟩
Témata: MSC (2020) : 05D10, 05C05, 05C55, 54E35, 46B20, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]
Geografické téma: Prague, Czech Republic
Relation: https://doi.org/10.48550/arxiv.2303.14577; info:eu-repo/semantics/altIdentifier/arxiv/2303.14577; ARXIV: 2303.14577
-
4
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.science/hal-04654840 ; 2024.
Témata: triangulations, twin-width, Whitney embedding theorem, structural graph parameters, computational topology, MSC: 57Q15 (Primary) 57R05, 05C75, 57M15 (Secondary), ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.10174; ARXIV: 2407.10174
-
5
Autoři: a další
Přispěvatelé: a další
Zdroj: ALENEX 2022 - SIAM Symposium on Algorithm Engineering and Experiments ; https://inria.hal.science/hal-03431155 ; ALENEX 2022 - SIAM Symposium on Algorithm Engineering and Experiments, Jan 2022, Alexandria, VA, United States. pp.78-90, ⟨10.1137/1.9781611977042.7⟩
Témata: Gromov hyperbolicity, Graph algorithms, Algorithm engineering, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Geografické téma: Alexandria, VA, United States
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2111.08520; ARXIV: 2111.08520
-
6
Autoři: a další
Přispěvatelé: a další
Zdroj: Congrès Reconnaissance des Formes, Image, Apprentissage et Perception ( RFIAP) ; https://hal.science/hal-03696263 ; Congrès Reconnaissance des Formes, Image, Apprentissage et Perception ( RFIAP), Jul 2022, VANNES, France
Témata: Graph Neural Networks, Graph Pooling, Graph Classification, Maximal Independant Vertex Set, Réseaux de neurones sur graphes, Ensemble de sommets indépendant maximal, Classification de graphes, Pooling sur graphes, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]
-
7
Autoři:
Přispěvatelé:
Zdroj: International Workshop of Services and Industry of the Future (IWSIF 2022) ; https://hal.archives-ouvertes.fr/hal-03825330 ; International Workshop of Services and Industry of the Future (IWSIF 2022), Oct 2022, Rabat, Morocco
Témata: Industry 40, Microservices, Graph theory analysis, Graph algorithms, Digitalisation, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.8: Validation, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.8: Metrics/D.2.8.1: Performance measures, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.11: Software Architectures, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Relation: hal-03825330; https://hal.archives-ouvertes.fr/hal-03825330; https://hal.archives-ouvertes.fr/hal-03825330/document; https://hal.archives-ouvertes.fr/hal-03825330/file/Microservices%20and%20Industry%204.0%20using%20Graph%20Theory.pdf
-
8
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.science/hal-04013152 ; 2023.
Témata: Phylogenetic Networks, Tree Containment, Caterpillar Tree, Hybridization Number, Phylogenetic Networks Tree Containment Caterpillar Tree Hybridization Number, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: hal-04013152; https://hal.science/hal-04013152; https://hal.science/hal-04013152v3/document; https://hal.science/hal-04013152v3/file/main.pdf
-
9
Autoři: a další
Přispěvatelé: a další
Zdroj: EISSN: 2750-7823 ; Computing in Geometry and Topology ; https://hal.science/hal-03373577 ; Computing in Geometry and Topology, 2022, 1 (1), pp.1:1-1:19. ⟨10.57717/cgt.v1i1.4⟩ ; https://www.cgt-journal.org/
Témata: computational 3-manifold topology, fixed-parameter tractability, generalized Heegaard splittings, pathwidth, treewidth, hyperbolic 3-manifolds, thick-thin decomposition, volume, complexité paramétrée, décomposition épaisse-fine, 3-variétés hyperboliques, largeur arborescente, largeur arborescente linéaire, divisions de Heegaard généralisées, solubilité à paramètre fixé, topologie algorithmique des 3-variétés, MSC 57Q15, 57N10, 05C75, 57M15, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2105.11371; ARXIV: 2105.11371
-
10
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 0166-218X ; Discrete Applied Mathematics ; https://inria.hal.science/hal-01743802 ; Discrete Applied Mathematics, 2022, 308, pp.130--146. ⟨10.1016/j.dam.2020.07.016⟩.
Témata: Permanent approximation, Sinkhorn-Knopp scaling, randomized algorithms, doubly stochastic matrices, matrices bistochastiques, permanent, algorithmes randomisés, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
11
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 0028-3045.
Témata: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2111.08328; ARXIV: 2111.08328
-
12
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 0885-6125.
Témata: Large multigraph, Graphon Theory, Markov Logic Network, Large Deviation Principle, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [PHYS.PHYS.PHYS-DATA-AN]Physics [physics]/Physics [physics]/Data Analysis, Statistics and Probability [physics.data-an], [STAT.ML]Statistics [stat]/Machine Learning [stat.ML]
-
13
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 2231-007X.
Témata: Graph, Partitioning, Graph partitioning, Geometric partitioning, Spatial, Geography, Geometric, Space Filling Curve, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, ACM: H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.4: Systems/H.2.4.1: Distributed databases, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
14
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 0938-1279.
Témata: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.1: Combinatorics/G.2.1.0: Combinatorial algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.5: Roots of Nonlinear Equations/G.1.5.5: Systems of equations, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]
-
15
Autoři:
Přispěvatelé:
Zdroj: ISSN: 1462-7264.
Témata: quantum graphs, stabilization time, system of dynamic points, discrete event dynamic systems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]
Relation: hal-02964390; https://hal.archives-ouvertes.fr/hal-02964390; https://hal.archives-ouvertes.fr/hal-02964390/document; https://hal.archives-ouvertes.fr/hal-02964390/file/OnMetricGraphs.pdf
-
16
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.science/hal-03368362 ; 2021.
Témata: Hamiltonian Cycles, tournaments, Rosenfeld' conjecture, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
-
17
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.inria.fr/hal-03430099 ; 2021.
Témata: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2111.08328; hal-03430099; https://hal.inria.fr/hal-03430099; https://hal.inria.fr/hal-03430099/document; https://hal.inria.fr/hal-03430099/file/main.pdf; ARXIV: 2111.08328
-
18
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.archives-ouvertes.fr/hal-03373577 ; 2021.
Témata: computational 3-manifold topology, fixed-parameter tractability, generalized Heegaard splittings, pathwidth, treewidth, hyperbolic 3-manifolds, thick-thin decomposition, volume, topologie algorithmique des 3-variétés, complexité paramétrée, solubilité à paramètre fixé, divisions de Heegaard généralisées, largeur arborescente linéaire, largeur arborescente, 3-variétés hyperboliques, décomposition épaisse-fine, MSC 57Q15, 57N10, 05C75, 57M15, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2105.11371; hal-03373577; https://hal.archives-ouvertes.fr/hal-03373577; https://hal.archives-ouvertes.fr/hal-03373577/document; https://hal.archives-ouvertes.fr/hal-03373577/file/arxiv_v1.pdf; ARXIV: 2105.11371
-
19
Exact values for three domination-like problems in circular and infinite grid graphs of small height
Autoři: a další
Přispěvatelé: a další
Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol Vol. 21 no. 3, Iss Graph Theory (2019)
Témata: FOS: Computer and information sciences, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.4: Path and circuit problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.1: Graph labeling, Discrete Mathematics (cs.DM), acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.0: graph algorithms, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, locating-dominating code, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, 01 natural sciences, grid, identifying code, [info.info-dm]computer science [cs]/discrete mathematics [cs.dm], graph algorithm, QA1-939, acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory, acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.1: graph labeling, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.4: path and circuit problems, locating-total-dominating code, Mathematics, Computer Science - Discrete Mathematics
Popis souboru: application/pdf
Přístupová URL adresa: http://arxiv.org/abs/1708.00758
https://dmtcs.episciences.org/3843
https://doi.org/10.23638/dmtcs-21-3-12
https://doaj.org/article/a934efee596a4867804dd16d5219879e
https://hal-laas.archives-ouvertes.fr/hal-01569881v2
https://dmtcs.episciences.org/5458/pdf
https://dblp.uni-trier.de/db/journals/dmtcs/dmtcs21.html#BouznifDMP19
https://arxiv.org/abs/1708.00758
https://hal.archives-ouvertes.fr/hal-01569881/document
http://ui.adsabs.harvard.edu/abs/2017arXiv170800758B/abstract
https://hal.science/hal-01569881v3
https://hal.science/hal-01569881v3/document
https://doi.org/10.23638/dmtcs-21-3-12 -
20
Autoři: a další
Přispěvatelé: a další
Zdroj: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation ; ISSAC '18 International Symposium on Symbolic and Algebraic Computation ; https://hal.science/hal-01710518 ; ISSAC '18 International Symposium on Symbolic and Algebraic Computation, Jul 2018, New York, United States. pp.55-62, ⟨10.1145/3208976.3208994⟩
Témata: rigid graph, mixed volume, spatial embedding, real bound, coupler curve, Cayley-Menger matrix, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.5: Roots of Nonlinear Equations/G.1.5.5: Systems of equations, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]
Geografické téma: New York, United States
Relation: info:eu-repo/grantAgreement//675789/EU/Algebraic Representations in Computer-Aided Design for complEx Shapes/ARCADES
Nájsť tento článok vo Web of Science 
Full Text Finder