O(n²) Algorithms for Graph Planarization.
R. JayakumarKrishnaiyan ThulasiramanM. N. S. SwamyPublished in: WG (1988)
Keyphrases
- graph theory
- computational complexity
- evolutionary algorithm
- computational cost
- worst case
- orders of magnitude
- simulated annealing
- optimization problems
- random walk
- graph theoretic
- connected components
- equivalence classes
- data sets
- web graph
- spanning tree
- graph structure
- times faster
- benchmark datasets
- theoretical analysis
- data mining techniques