Output-sensitive algorithm for the edge-width of an embedded graph.
Sergio CabelloÉric Colin de VerdièreFrancis LazarusPublished in: SCG (2010)
Keyphrases
- detection algorithm
- optimal solution
- dynamic programming
- undirected graph
- optimization algorithm
- search space
- k means
- expectation maximization
- computational complexity
- cost function
- spanning tree
- graph structure
- similarity measure
- dominating set
- graph based algorithm
- maximum flow
- input data
- worst case
- computational cost
- preprocessing
- learning algorithm
- np complete
- matching algorithm
- graph theory
- graph model
- graph partitioning
- np hard
- polynomial time complexity