DOCSLIB.ORG
Sign Up
Log In
Upload
Search
Sign Up
Log In
Upload
Home
» Tags
» Graph bandwidth
Graph bandwidth
1 Introduction and Terminology
On Bounding the Bandwidth of Graphs with Symmetry
Exact and Approximate Bandwidth
Counting Subgraphs Via Homomorphisms∗
Exact and Approximate Bandwidth
Parameterized Complexity and Approximation Algorithms
Bandwidth of Bipartite Permutation Graphs in Polynomial Time ∗
Lower Bounds for the Bandwidth Problem ∗
Lower Bounds for the Bandwidth Problem ∗
The Edge-Bandwidth Minimization Problem
Chronological Index
Spanheight, a Natural Extension of Bandwidth and Treedepth
Exact and Approximate Digraph Bandwidth
A Subexponential Parameterized Algorithm for Proper Interval Completion∗
Graph Modification Problems Related to Graph Classes
Bandwidth, Edgesum and Profile of Graphs
On Semidefinite Programming Bounds for Graph Bandwidth
Top View