-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.
Erik D. DemaineMohammad Taghi HajiaghayiDimitrios M. ThilikosPublished in: APPROX (2002)
Keyphrases
- bounded treewidth
- graph structure
- graph representation
- graph theory
- graph matching
- weighted graph
- np complete
- graph databases
- directed graph
- graph structures
- constraint graph
- graph construction
- labeled graphs
- graph clustering
- graph theoretic
- adjacency matrix
- graph search
- bipartite graph
- graph model
- undirected graph
- graph mining
- graph properties
- graph partitioning
- graph representations
- series parallel
- graph theoretical
- graph isomorphism
- discrete random variables
- graph classification
- structural pattern recognition
- graph kernels
- random graphs
- dynamic graph
- graph data
- spanning tree
- structured data
- maximum cardinality
- approximation algorithms
- reachability queries
- community discovery
- boolean functions
- subgraph isomorphism
- conjunctive queries
- laplacian matrix
- upper bound
- edge weights
- graphical models
- graph patterns
- search space
- directed acyclic
- small world
- decision problems
- real world graphs
- graph transformation
- polynomial time complexity
- dense subgraphs
- random walk
- finding the shortest path
- topological information
- frequent subgraphs
- directed acyclic graph
- complex networks
- constraint satisfaction problems
- search algorithm
- maximum common subgraph