Výsledky vyhledávání - ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.archives-ouvertes.fr/tel-03517128 ; Formal Languages and Automata Theory [cs.FL]. Université de Lille, 2021. English.
Témata: shell scripts, verification, transducers, functional programming, Trees, scripts shell, transducteurs, programmation fonctionnelle, Arbres, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.5: Program analysis, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.4: Operations on languages, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-OS]Computer Science [cs]/Operating Systems [cs.OS]
Relation: tel-03517128; https://hal.archives-ouvertes.fr/tel-03517128; https://hal.archives-ouvertes.fr/tel-03517128/document; https://hal.archives-ouvertes.fr/tel-03517128/file/main.pdf
-
2
Autoři: a další
Přispěvatelé: a další
Zdroj: EPTCS ; 1st International Workshop on Strategic Reasoning, {SR} 2013 ; https://inria.hal.science/hal-01098745 ; 1st International Workshop on Strategic Reasoning, {SR} 2013, Mar 2013, Rome, Italy. pp.8, ⟨10.4204/EPTCS.112.17⟩
Témata: game theory, imperfect imformation, complexity, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.1: Applications and Expert Systems/I.2.1.1: Games, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT]
-
3
Autoři: a další
Přispěvatelé: a další
Zdroj: 9th ACM International Conference on Distributed Event-Based Systems
https://hal.science/hal-01170923
9th ACM International Conference on Distributed Event-Based Systems, Jun 2015, Oslo, Norway. pp.293-300, ⟨10.1145/2675743.2772587⟩
http://doi.acm.org/10.1145/2675743.2772587Témata: Top-K Continuous Queries, RDF Graph Streaming, Range Trees, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.4: Knowledge Representation Formalisms and Methods/I.2.4.6: Semantic networks, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: H.: Information Systems/H.3: INFORMATION STORAGE AND RETRIEVAL/H.3.2: Information Storage, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
4
Autoři: a další
Přispěvatelé: a další
Zdroj: Combinatorial Optimization, 5th International Symposium, ISCO 2018 ; International Symposium on Combinatorial Optimization (ISCO 2018) ; https://hal.science/hal-01815768 ; International Symposium on Combinatorial Optimization (ISCO 2018), Apr 2018, Marrakech, Morocco
Témata: trees, online, Firefighter, graph theory, 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/G.2.2.5: Trees, [INFO]Computer Science [cs], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: info:eu-repo/grantAgreement//691161/EU/Geospatial based Environment for Optimisation Systems Addressing Fire Emergencies/GEO-SAFE
-
5
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
-
6
Autoři: a další
Přispěvatelé: a další
Zdroj: ACM Symposium on Applied Computing (SAC) ; https://hal.univ-brest.fr/hal-01768636 ; ACM Symposium on Applied Computing (SAC), Apr 2018, Pau, France
Témata: ACM: H.: Information Systems/H.3: INFORMATION STORAGE AND RETRIEVAL, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-OS]Computer Science [cs]/Operating Systems [cs.OS]
Relation: hal-01768636; https://hal.univ-brest.fr/hal-01768636
Dostupnost: https://hal.univ-brest.fr/hal-01768636
-
7
Autoři:
Přispěvatelé:
Zdroj: https://hal.science/hal-01827567 ; 2018.
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-CC]Computer Science [cs]/Computational Complexity [cs.CC]
-
8
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 2327-5219.
Témata: Branch and Bound, Partial Minimum Spanning Hierarchy, Hierarchy, Multi-Constrained Steiner Problem, Quality of Service, Multicast Routing, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.3: Network problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, 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, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
9
Autoři: a další
Přispěvatelé: a další
Zdroj: Complex Networks - Results of the 2009 International Workshop on Complex Networks (CompleNet 2009) ; https://inria.hal.science/inria-00312059 ; Santo Fortunato and Giuseppe Mangioni and Ronaldo Menezes and Vincenzo Nicosia. Complex Networks - Results of the 2009 International Workshop on Complex Networks (CompleNet 2009), 207, Springer Berlin / Heidelberg, pp.99-113, 2009, Studies in Computational Intelligence, 978-3-642-01205-1. ⟨10.1007/978-3-642-01206-8_9⟩
Témata: random graph generation, k-trees, attachment models, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, 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/G.2.2.3: Network problems, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation
-
10
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 1084-6654 ; ACM Journal of Experimental Algorithmics ; https://hal.inria.fr/hal-01182890 ; ACM Journal of Experimental Algorithmics, Association for Computing Machinery, 2015, 20 (1), pp.18. ⟨10.1145/2780652⟩.
Témata: Algorithms, Gromov Hyperbolicity, Networks, 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.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Relation: info:eu-repo/grantAgreement/EC/FP7/258307/EU/Experimental UpdateLess Evolutive Routing/EULER; hal-01182890; https://hal.inria.fr/hal-01182890; https://hal.inria.fr/hal-01182890/document; https://hal.inria.fr/hal-01182890/file/CCL15-no-format.pdf
-
11
Autoři:
Zdroj: ACM Transactions on Algorithms; Jan2025, Vol. 21 Issue 1, p1-41, 41p
-
12
Autoři:
Zdroj: ACM Transactions on Mathematical Software; 2011, Vol. 37 Issue 3, p24-24:17, 17p
-
13
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, G.3 [Probability and Statistics, —Probabilistic algorithms (including Monte Carlo, Statistical computing, G.2.2 [Discrete Mathematics, Graph Theory—Trees, E.1 [Data Structures, —Trees General Terms, Algorithms, Design, Performance, Theory Additional Key Words and Phrases, multivariate histogram, Markov chain Monte Carlo, Bayesian estimation, Catalan Prior, averaging tree-based histograms, statistical regular pavings ACM Reference Format
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.5765; http://www.math.canterbury.ac.nz/~r.sainudiin/preprints/SubPavingMCMC0.pdf
-
14
Autoři: a další
Přispěvatelé: a další
Zdroj: https://inria.hal.science/inria-00306687 ; [Research Report] PI-1900, 2008, pp.47.
Témata: Graph theory, spanning problems, partial spanning trees, optimization with constraints, hierarchies, minimal cost hierarchies, networks, multicast routing, optical networks, multiconstrained multicast routing, 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]
-
15
Autoři: a další
Přispěvatelé: a další
Zdroj: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
MFCS 2020 : The 45th International Symposium on Mathematical Foundations of Computer Science
https://hal.science/hal-02902853
MFCS 2020 : The 45th International Symposium on Mathematical Foundations of Computer Science, Andreas Feldmann
Michal Koucky
Anna Kotesovcova, Aug 2020, Prague, Czech Republic. ⟨10.4230/LIPIcs.MFCS.2020.34⟩Témata: Transducers, λ-calculus, Tree lanuages, and phrases Transducers, Trees 31, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Geografické téma: Prague, Czech Republic
-
16
Autoři: a další
Přispěvatelé: a další
Zdroj: SPM '07: Proceedings of the 2007 ACM symposium on Solid and physical modeling, ACM ; https://inria.hal.science/inria-00202636 ; SPM '07: Proceedings of the 2007 ACM symposium on Solid and physical modeling, ACM, Jun 2007, Beijing, China. pp.283-289, ⟨10.1145/1236246.1236286⟩ ; http://hal.inria.fr/docs/00/20/26/36/PDF/gong_brep_07-1.pdf
Témata: 2-manifold, Möbius rule, graph theory, model conversion, solid reconstruction, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling/I.3.5.0: Boundary representations, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, ACM: J.: Computer Applications/J.6: COMPUTER-AIDED ENGINEERING, [INFO.INFO-IA]Computer Science [cs]/Computer Aided Engineering
Relation: PRODINRA: 245640
-
17
Autoři: a další
Přispěvatelé: a další
Zdroj: EISSN: 1936-4954 ; SIAM Journal on Imaging Sciences ; https://hal.archives-ouvertes.fr/hal-03631338 ; SIAM Journal on Imaging Sciences, Society for Industrial and Applied Mathematics, In press
Témata: Perimeter, total variation, graph cuts, mean curvature flow, image processing, data clustering, PdE on graph, AMS subject classifications. 68Q25, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.8: Partial Differential Equations, ACM: I.: Computing Methodologies/I.4: IMAGE PROCESSING AND COMPUTER VISION, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Relation: hal-03631338; https://hal.archives-ouvertes.fr/hal-03631338; https://hal.archives-ouvertes.fr/hal-03631338v2/document; https://hal.archives-ouvertes.fr/hal-03631338v2/file/nonlocal_perimeter.pdf
-
18
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal-lirmm.ccsd.cnrs.fr/tel-01168561 ; Traitement des images [eess.IV]. Université Montpellier 2, 2008.
Témata: combinatorial algorithms, Digital image, image processing, digital topology, region segmentation, Combinatorial maps, Cartes combinatoires, Algorithmes combinatoires, Segmentation d'images, Topologie discrète, Traitement d'images, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.2: Geometrical problems and computations, 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/G.2.2.0: Graph algorithms, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.1: Graph labeling, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.10: Vision and Scene Understanding/I.2.10.6: Representations, data structures, and transforms, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.3: Picture/Image Generation/I.3.3.4: Line and curve generation, ACM: I.: Computing Methodologies/I.4: IMAGE PROCESSING AND COMPUTER VISION/I.4.6: Segmentation/I.4.6.2: Region growing, partitioning, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
-
19
Autoři: a další
Přispěvatelé: a další
Zdroj: https://tel.archives-ouvertes.fr/tel-01110316 ; Algorithme et structure de données [cs.DS]. Universite de Bordeaux, 2014. Français.
Témata: emergency planning, forbidden-set connectity, labeling scheme, graphs on surfaces, graph minor, planification de l’urgence, schéma d’étiquetage, connexité avec panne, mineur de graphe, graphes sur les surfaces, 05C10 05C78 05C83 05C85 68R10 68W15, 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, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.1: Graph labeling, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.4: Path and circuit problems, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Relation: tel-01110316; https://tel.archives-ouvertes.fr/tel-01110316; https://tel.archives-ouvertes.fr/tel-01110316/document; https://tel.archives-ouvertes.fr/tel-01110316/file/these.pdf
-
20
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]
Nájsť tento článok vo Web of Science 
Full Text Finder