Journal of Graph Theory · 2000 · 11 citations · 4 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsDiscrete MathematicsGraph AlgorithmsGraph LabelingGraph TheoryDisjoint PathsDisjoint Paths ProblemEdge LabelingEdge-diameterEdge-disjoint PathsGraph Theory AnalysisLabelingTheta Theory
An edge-labeling f of a graph G is an injection from E(G) to the set of integers. The edge-bandwidth of G is B′(G) = minf {B′(f)} where B′(f) is the maximum difference between labels of incident edges of G. The theta graph Θ(l1,…,lm) is the graph consisting of m pairwise internally disjoint paths with common endpoints and lengths l1 ≤ ··· ≤ lm. We determine the edge-bandwidth of all theta graphs. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 89–98, 2000
4
The NP-Completeness of the bandwidth minimization problem
Ch. H. Papadimitriou · Computing · 1976 · 409 citations
Complexity Results for Bandwidth Minimization
M. R. Garey, Ronald Graham, David S. Johnson et al. · SIAM Journal on Applied Mathematics · 1978 · 296 citations
Bandwidth of theta graphs with short paths
G. W. Peck, Aditya Shastri · Discrete Mathematics · 1992 · 12 citations
Tao Jiang, Dhruv Mubayi, Aditya Shastri et al. · SIAM Journal on Discrete Mathematics · 1999 · 10 citations