Bandwidth of Bipartite Permutation Graphs in Polynomial Time.
Pinar HeggernesDieter KratschDaniel MeisterPublished in: LATIN (2008)
Keyphrases
- graph model
- bipartite graph
- graph isomorphism
- graph partitioning
- undirected graph
- bounded treewidth
- polynomial time complexity
- approximation algorithms
- special case
- graph databases
- real time
- planar graphs
- graph matching
- graph representation
- graph clustering
- graph theoretic
- np complete
- worst case
- bandwidth allocation
- greedy algorithm
- random graphs
- network bandwidth
- high bandwidth
- approximation guarantees
- graph mining
- graph structure
- graph theory