Fully dynamic algorithms for chordal graphs and split graphs.
Louis IbarraPublished in: ACM Trans. Algorithms (2008)
Keyphrases
- graph theory
- dynamic graph
- graph isomorphism
- computational cost
- graph matching
- data structure
- computational complexity
- theoretical analysis
- directed graph
- max cut
- graph theoretic
- graph mining
- computationally efficient
- learning algorithm
- optimization problems
- undirected graph
- significant improvement
- dynamic networks
- combinatorial optimization
- benchmark datasets
- bipartite graph
- graph search
- maximal cliques
- series parallel
- social networks
- polynomial time complexity
- data mining