Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs
Emeric GioanChristophe PaulPublished in: CoRR (2008)
Keyphrases
- graph theory
- dynamic graph
- random graphs
- graph search
- graph representation
- graph structure
- graph representations
- graph construction
- directed graph
- polynomial time complexity
- graph layout
- graph model
- graph databases
- data structure
- decision trees
- minimum spanning tree
- strongly connected components
- social networks
- maximal cliques
- graph theoretical
- labeled graphs
- maximum clique
- graph properties
- graph isomorphism
- graph matching algorithm
- learning algorithm
- graph data
- graph mining
- dynamic networks
- graph matching
- directed acyclic graph
- maximum cardinality
- massive graphs
- np complete
- subgraph mining
- connected components
- bipartite graph
- edge weights
- structural learning
- graph structures
- series parallel
- graph embedding