Pages that link to "Item:Q1044045"
From MaRDI portal
The following pages link to Bandwidth of bipartite permutation graphs in polynomial time (Q1044045):
Displaying 9 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Linear-time algorithms for counting independent sets in bipartite permutation graphs (Q1675914) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
