A polynomial-time algorithm to find a linkless embedding of a graph.
Hein van der HolstPublished in: J. Comb. Theory, Ser. B (2009)
Keyphrases
- computational complexity
- weighted graph
- cost function
- worst case
- polynomial time complexity
- np hard
- graph based algorithm
- graph model
- preprocessing
- detection algorithm
- learning algorithm
- random graphs
- shortest path
- approximation ratio
- causal graph
- graph isomorphism
- dominating set
- strongly polynomial
- spanning tree
- clustering method
- expectation maximization
- linear programming
- special case
- k means
- search algorithm
- similarity measure