Graph Decompositions
Graph decomposition is a method in graph theory that partitions a graph into a collection of subgraphs or edge-disjoint substructures according to specific structural or connectivity constraints, enabling the analysis of complex networks through simpler, constituent components.
1.1K
Publications
70.8K
Citations
1.9K
Authors
788
Institutions
Publications per year
2017–2026
171
Variants
Graph Decomposition
Parents
1.1K
1–5 of 1.1K
1.9K
10
h-index
10
h-index
10
h-index
8
h-index
8
h-index
1–5 of 1.9K
788

Centre National de la Recherche Scientifique
Paris, France
19 h-index
58 publications
2.4K citations
Carnegie Mellon University
Pittsburgh, United States
17 h-index
34 publications
2.1K citations

The University of Queensland
Brisbane, Australia
15 h-index
36 publications
1.2K citations

University of Waterloo
Waterloo, Canada
14 h-index
22 publications
1.7K citations
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
23 publications
1.8K citations
University of California, Berkeley
Berkeley, United States
14 h-index
31 publications
2.1K citations

Tel Aviv University
Tel Aviv, Israel
14 h-index
24 publications
874 citations
University of Oxford
Oxford, United Kingdom
13 h-index
21 publications
573 citations
1–8 of 788
52 publications · 1.7K citations
27
h-index
79 publications · 2.3K citations
24
h-index
50 publications · 2.1K citations
23
h-index
38 publications · 1.1K citations
21
h-index
28 publications · 1.1K citations
19
h-index
1–5