Cubicity and bandwidth
type: Item
instance of: scholarly article
title: Cubicity and bandwidth
zbMATH Open document ID: 1258.05086
author: L. Sunil Chandran
author: Mathew C. Francis
author: Naveen Sivadasan
published in: Graphs and Combinatorics
publication date: 2013-02-25T00:00:00Z
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6138693
zbMATH Keywords: cubicity
zbMATH Keywords: bandwidth
zbMATH Keywords: geometric intersection graphs
zbMATH Keywords: randomized algorithms
zbMATH Keywords: derandomization
MaRDI profile type: Publication
full work available at URL: s00373-011-1099-x
OpenAlex ID: W2017229590
cites work: Cubicity of threshold graphs
cites work: Cubicity of interval graphs and the claw number
cites work: Label placement by maximum independent set in rectangles
cites work: Efficient approximation algorithms for tiling and packing problems with rectangles
cites work: Cubicity, boxicity, and vertex cover
cites work: Geometric representation of graphs in low dimension using axis parallel boxes
cites work: On the cubicity of certain graphs
cites work: An upper bound for cubicity in terms of boxicity
cites work: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
cites work: Q4542524
cites work: On the sphericity and cubicity of graphs
cites work: Optimal embedding of complete binary trees into lines and grids
cites work: Q2766686
cites work: Approximating the Bandwidth for Asteroidal Triple-Free Graphs
cites work: Domination on Cocomparability Graphs
cites work: Approximating Bandwidth by Mixing Layouts of Interval Graphs
cites work: Sphericity exceeds cubicity for almost all complete bipartite graphs
cites work: Sphere of influence graphs and the \(L_{\infty}\)-metric
cites work: Sphericity, cubicity, and edge clique covers of graphs
cites work: Q5588433
cites work: Q5387691
cites work: On the Probable Performance of Heuristics for Bandwidth Minimization
cites work: Graph-Theoretic Concepts in Computer Science
cites work: The Complexity of the Partial Order Dimension Problem
DOI: 10.1007/S00373-011-1099-X
description: scientific article; zbMATH DE number 6138693