Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs.
Emeric GioanChristophe PaulPublished in: Discret. Appl. Math. (2012)
Keyphrases
- graph theory
- dynamic graph
- graph representation
- graph structure
- maximum clique
- maximal cliques
- graph construction
- minimum spanning tree
- graph properties
- graph data
- graph search
- graph structures
- graph theoretical
- polynomial time complexity
- learning algorithm
- decision trees
- graph layout
- strongly connected components
- massive graphs
- graph theoretic
- data structure
- bipartite graph
- weighted graph
- graph mining
- graph databases
- web graph
- undirected graph
- series parallel
- strongly connected
- structural learning
- graph model
- dynamic networks
- tree decomposition
- pattern mining
- complex networks
- random graphs