Suchergebnisse - acm classification: g.2.1 combinatorics g.2.2 graph theory general terms: algorithms*

Forbidden subgraphs in connected graphs

Autoren: Ravelomanana, Vlady Loÿs, Thimonier Laboratoire d'Informatique de Paris-Nord (LIPN) et al.

Weitere Verfasser: Ravelomanana, Vlady Loÿs, Thimonier Laboratoire d'Informatique de Paris-Nord (LIPN) et al.

Quelle: Theoretical Computer Science. 314:121-171

Schlagwörter: FOS: Computer and information sciences, Labelled graphs, triangle-free graphs, Discrete Mathematics (cs.DM), multivariate generating functions, Exact enumeration problems, generating functions, Random graphs (graph-theoretic aspects), 0102 computer and information sciences, enumerative combinatorics, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Enumeration in graph theory, 01 natural sciences, Combinatorial problems, forbidden subgraphs, Theoretical Computer Science, labelled graphs, asymptotic enumeration, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Computer Science - Data Structures and Algorithms, analytic combinatorics, FOS: Mathematics, Mathematics - Combinatorics, Theory, Data Structures and Algorithms (cs.DS), 0101 mathematics, Enumerative combinatorics, Triangle-free graphs, random graphs, Random graphs, Asymptotic enumeration, ACM Classification: G.2.1 Combinatorics G.2.2 Graph Theory General Terms: Algorithms, Combinatorics (math.CO), ACM Classification: G.2.1 Combinatorics G.2.2 Graph Theory General Terms: Algorithms, Theory, Multivariate generating functions, Analytic combinatorics, Computer Science(all), Computer Science - Discrete Mathematics

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/cs/0411093

An Algorithmic Framework for Locally Constrained Homomorphisms

Autoren: Bulteau, Laurent Dabrowski, Konrad Köhler, Noleen et al.

Weitere Verfasser: Bulteau, Laurent Dabrowski, Konrad Köhler, Noleen et al.

Quelle: 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.13453

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2201.11731
https://hal.science/hal-04495171v1
https://doi.org/10.1007/978-3-031-15914-5_9
https://hal.science/hal-04495171v1/document
http://dro.dur.ac.uk/37188/
http://dro.dur.ac.uk/37188/1/37188.pdf
https://doi.org/10.1007/978-3-031-15914-5_9

Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index.

Autoren: Bernshteyn, Anton Weilacher, Felix

Quelle: Transactions of the American Mathematical Society; Nov2025, Vol. 378 Issue 11, p8183-8221, 39p

Schlagwörter: DISTRIBUTED algorithms, COMBINATORICS, MONTE Carlo method, GRAPH theory, BOREL sets

A Near-Linear-Time Algorithm for Computing Replacement Paths in Planar Directed Graphs.

Autoren: EMEK, YUVAL PELEG, DAVID RODITTY, LIAM

Quelle: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 4, p64:1-64:13, 13p, 3 Diagrams

Schlagwörter: ALGORITHMS, DIRECTED graphs, GRAPH theory, LINEAR time invariant systems, COMBINATORICS

GRAPH CLASSES AND FORBIDDEN PATTERNS ON THREE VERTICES.

Autoren: FEUILLOLEY, LAURENT HABIB, MICHEL

Quelle: SIAM Journal on Discrete Mathematics; 2021, Vol. 35 Issue 1, p55-90, 36p

Schlagwörter: GRAPH theory, BIPARTITE graphs, GRAPH algorithms, COMBINATORICS, SUBGRAPHS, INTERSECTION graph theory, OPEN-ended questions

A POLYNOMIAL ALGORITHM FOR 3-COMPATIBLE COLORING AND THE STUBBORN LIST PARTITION PROBLEM (THE STUBBORN PROBLEM IS STUBBORN NO MORE).

Autoren: Cygan, Marek Pilipczuk, Marcin Pilipczuk, Michał et al.

Quelle: SIAM Journal on Computing; 2012, Vol. 41 Issue 4, p815-828, 14p

Schlagwörter: CONSTRAINT satisfaction, PARTITIONS (Mathematics), MATRICES (Mathematics), COMBINATORICS, ALGORITHMS

Improved mixing condition on the grid for counting and sampling independent sets.

Autoren: Restrepo, Ricardo Shin, Jinwoo Tetali, Prasad et al.

Quelle: Probability Theory & Related Fields; Jun2013, Vol. 156 Issue 1/2, p75-99, 25p, 3 Diagrams

Schlagwörter: SET theory, LATTICE gas, STATISTICAL physics, COMBINATORICS, COMPUTER science, PHASE transitions, APPROXIMATION algorithms

Treewidth computation and extremal combinatorics.

Autoren: Fomin, Fedor Villanger, Yngve

Quelle: Combinatorica; Apr2012, Vol. 32 Issue 3, p289-308, 20p

Schlagwörter: COMBINATORICS, ALGORITHMS, MATHEMATICAL analysis, EXPONENTS, GRAPH theory, GRAPHIC methods

Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors.

Autoren: GROHE, MARTIN

Quelle: Journal of the ACM; Oct2012, Vol. 59 Issue 5, p27-64, 64p

Schlagwörter: POLYNOMIALS, GRAPH theory, FIXED point theory, ALGORITHMS, COMBINATORICS, EMBEDDED computer systems

Subexponential Parameterized Algorithms on Bounded-Genus Graphs and H-Minor-Free Graphs.

Autoren: Demaine, Erik D. Fomin, Fedor V. Hajiaghayi, Mohammadtaghi et al.

Quelle: Journal of the ACM; Nov2005, Vol. 52 Issue 6, p866-893, 28p

Schlagwörter: ALGORITHMS, GRAPHIC methods, GRAPH theory, ALGEBRA, COMBINATORICS

Distributed algorithms, the Lovász Local Lemma, and descriptive combinatorics.

Autoren: Bernshteyn, Anton

Quelle: Inventiones Mathematicae; Aug2023, Vol. 233 Issue 2, p495-542, 48p

Schlagwörter: DISTRIBUTED algorithms, COMBINATORICS, COMPUTER science, GRAPH coloring, GRAPH algorithms, TOPOLOGY, ERGODIC theory

MAXIMUM r-REGULAR INDUCED SUBGRAPH PROBLEM: FAST EXPONENTIAL ALGORITHMS AND COMBINATORIAL BOUNDS.

Autoren: GUPTA, SUSHMITA RAMAN, VENKATESH SAURABH, SAKET

Quelle: SIAM Journal on Discrete Mathematics; 2012, Vol. 26 Issue 4, p1758-1780, 23p

Schlagwörter: SUBGRAPHS, GRAPH theory, ISOMORPHISM (Mathematics), EXPONENTIAL functions, ALGORITHMS, COMBINATORICS

Computational Folkloristics.

Quelle: Communications of the ACM; Jul2012, Vol. 55 Issue 7, p60-70, 11p, 7 Color Photographs, 2 Charts, 3 Graphs

Schlagwörter: FOLKLORE research, ALGORITHMS, ELECTRONIC information resources, TALE type indexes, GRAPH theory, COMBINATORICS, METHODOLOGY

Combinatorial algorithms for distributed graph coloring.

Autoren: Barenboim, Leonid Elkin, Michael

Quelle: Distributed Computing; Apr2014, Vol. 27 Issue 2, p79-93, 15p

Schlagwörter: GRAPH coloring, COMBINATORICS, ALGORITHMS, PROOF theory, SENSOR networks, GRAPH theory

A NEW INTERSECTION MODEL AND IMPROVED ALGORITHMS FOR TOLERANCE GRAPHS.

Autoren: Mertzios, George B. Sau, Ignasi Zaks, Shmuel

Quelle: SIAM Journal on Discrete Mathematics; 2009, Vol. 23 Issue 4, p1800-1813, 14p, 7 Diagrams

Schlagwörter: ALGORITHMS, GRAPH theory, PERMUTATIONS, COMBINATORICS, GRAPHIC methods, MATHEMATICAL analysis

Approximating Rank-Width and Clique-Width Quickly.

Autoren: Sang-Il Oum

Quelle: ACM Transactions on Algorithms; 2008, Vol. 5 Issue 1, p10-10:20, 20p, 1 Diagram, 5 Charts

Schlagwörter: APPROXIMATION theory, FUNCTIONAL analysis, ALGORITHMS, GRAPH theory, COMBINATORICS, MATHEMATICAL analysis

New advances in the computational exploration of semifields.

Autoren: Combarro, ElíasF. Rúa, I.F. Ranilla, J.

Quelle: International Journal of Computer Mathematics; Jun2011, Vol. 88 Issue 9, p1990-2000, 11p, 4 Charts

Schlagwörter: FINITE groups, FINITE geometries, PROJECTIVE planes, GRAPH theory, CLASSIFICATION, ALGORITHMS, COMBINATORICS, CODING theory

An experimental study of algorithms for fully dynamic transitive closure

Autoren: Ioannis Krommidas Christos Zaroliagis The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Ioannis Krommidas Christos Zaroliagis The Pennsylvania State University CiteSeerX Archives

Quelle: https://www.ceid.upatras.gr/webpages/faculty/zaro/pub/jou/J26-KZ-ACM-JEA-Vol12-N1.6-2008.pdf.

Schlagwörter: Categories and Subject Descriptors, G.2.1 [Combinatorics, Combinatorial algorithms, G.2.2 [Graph Theory, Graph algorithms, Network problems, Path and circuit problems, G.4 [Mathe- matical Software, Algorithm design and analysis, D.2.8 [Metrics, Performance Measures, E.1 [Data Structures, Graphs and Networks General Terms, Algorithm, Design, Experimentation, Measurement, Performance Additional Key Words and Phrases, Transitive closure, path, reachability, dynamic algorithm ACM Reference Format

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.701.7615

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.701.7615

Improved Algorithms for Weakly Chordal Graphs.

Autoren: Hayward, Ryan B. Spinrad, Jeremy P. Sritharan, R.

Quelle: ACM Transactions on Algorithms; 2007, Vol. 3 Issue 2, p1-19, 19p

Schlagwörter: GRAPH algorithms, GRAPH theory, COMPUTATIONAL complexity, MATHEMATICAL optimization, COMBINATORICS, TOPOLOGY, ELECTRONIC data processing

Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices.

Autoren: Abarca, M. Rivera, D.

Quelle: Fundamenta Informaticae; 2016, Vol. 149 Issue 3, p241-261, 21p

Schlagwörter: GRAPH theory, MATRICES (Mathematics), DYNKIN diagrams, POLYNOMIAL time algorithms, COMBINATORICS