Bandwidth of bipartite permutation graphs in polynomial time.
Pinar HeggernesDieter KratschDaniel MeisterPublished in: J. Discrete Algorithms (2009)
Keyphrases
- graph model
- bipartite graph
- graph partitioning
- graph isomorphism
- undirected graph
- planar graphs
- polynomial time complexity
- bounded treewidth
- approximation algorithms
- weighted graph
- graph theoretic
- real valued
- graph theory
- worst case
- vertex set
- high bandwidth
- graph clustering
- special case
- graph databases
- graph matching
- computational complexity
- graph mining
- greedy algorithm
- np complete
- minimum cost
- graph structures
- graph structure
- approximation ratio
- subgraph isomorphism
- directed graph
- bandwidth allocation
- bipartite networks
- connected graphs