Get started
Keyword

graph decomposition

Description: The division of a graph into smaller subgraphs or components, used in combinatorial algorithms, clustering, and graph analysis.
OpenAlex ID: keywords/graph-decomposition
Graph Classes: A Survey
1999 · Andreas Brandstädt, Van Bang Le, et al. · Society for Industrial and Applied Mathematics eBooks · 1,758
Approximation algorithms for NP-complete problems on planar graphs
1994 · Brenda S. Baker · Journal of the ACM · 947
PDF
Dividing a Graph into Triconnected Components
1973 · J. E. Hopcroft, R. E. Tarjan · SIAM Journal on Computing · 833
Complement reducible graphs
1981 · D.G. Corneil, H. Lerchs, et al. · Discrete Applied Mathematics · 828
Regular Partitions of Graphs
1975 · Endre Szemerédi · Defense Technical Information Center (DTIC) · 759
Graph minors. X. Obstructions to tree-decomposition
1991 · Neil Robertson, P.D Seymour · Journal of Combinatorial Theory Series B · 658
On the Problem of Decomposing a Graph into n Connected Factors
1961 · W. T. Tutte · Journal of the London Mathematical Society · 658
Handbook of Combinatorial Designs
2006 · Charles J. Colbourn, Jeffrey H. Dinitz · 534
Non-separable and planar graphs
1932 · Hassler Whitney · Transactions of the American Mathematical Society · 503
PDF
Approximating clique-width and branch-width
2006 · Sang-il Oum, Paul Seymour · Journal of Combinatorial Theory Series B · 482
PDF
Coverings of Bipartite Graphs
1958 · A. L. Dulmage, N. S. Mendelsohn · Canadian Journal of Mathematics · 472
PDF
Decomposition of Finite Graphs Into Forests
1964 · C. St.J. A. Nash-Williams · Journal of the London Mathematical Society · 461
Decomposition by clique separators
1985 · Robert E. Tarjan · Discrete Mathematics · 437
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
1987 · Greg N. Federickson · SIAM Journal on Computing · 432
Graph Twiddling in a MapReduce World
2009 · J. Cohen · Computing in Science & Engineering · 400
Treewidth
1994 · Springer eBooks · 382
HARP: Hierarchical Representation Learning for Networks
2018 · Haochen Chen, Bryan Perozzi, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 361
A Combinatorial Decomposition Theory
1980 · William H. Cunningham, Jack Edmonds · Canadian Journal of Mathematics · 322
PDF
The Factors of Graphs
1952 · W. T. Tutte · Canadian Journal of Mathematics · 306
PDF
Sparse partitions
2002 · B. Awerbuch, D. Peleg · Annual Symposium on Foundations of Computer Science · 298
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
1996 · Hans L. Bodlaender, Ton Kloks · Journal of Algorithms · 293
Fast algorithms for determining (generalized) core groups in social networks
2010 · Vladimir Batagelj, Matjaž Zaveršnik · Advances in Data Analysis and Classification · 288
Fast Algorithms for Solving Path Problems
1981 · Robert Endre Tarjan · Journal of the ACM · 283
PDF
Algorithmic Aspects of Tree Width
2003 · B. A. Reed · Springer eBooks · 281
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
1999 · Monika R. Henzinger, Valerie King · Journal of the ACM · 270
PDF
Works count: 5,374
Citation count: 54,340
Year
Topic
Type