Extracting a planar spanning subgraph of a terminal-vertex graph by solving the independent set problem.
Tsutomu YamaokiSatoshi TaokaToshimasa WatanabePublished in: ISCAS (5) (2001)
Keyphrases
- independent set
- maximum weight
- minimum weight
- maximum independent set
- bipartite graph
- planar graphs
- weighted graph
- labeled graphs
- spanning tree
- edge weights
- greedy heuristic
- graph properties
- vertex set
- graph theory
- combinatorial optimization
- maximum matching
- minimum spanning tree
- np hard
- graph data
- graph theoretic
- directed graph
- tree patterns
- structured data
- dense subgraphs
- subgraph matching
- random walk