The Complexity of Graph Problems fore Succinctly Represented Graphs.
Antoni LozanoJosé L. BalcázarPublished in: WG (1989)
Keyphrases
- polynomial time complexity
- graph theory
- graph structure
- graph representation
- np complete
- maximum independent set
- graph theoretic
- graph partitioning
- graph mining
- graph matching
- random walk
- reachability queries
- directed graph
- decision problems
- graph search
- random graphs
- graph representations
- planar graphs
- finding the shortest path
- graph model
- link analysis
- graph mining algorithms
- computational complexity
- dynamic graph
- graph drawing
- weighted graph
- graph isomorphism
- graph theoretical
- bounded treewidth
- adjacency matrix
- graph construction
- undirected graph
- bipartite graph