Polynomial time efficient construction heuristics for vertex separation minimization problem

DOI10.1016/j.endm.2017.11.032zbMath1383.05080arXiv1702.05710MaRDI QIDQ2413384

Kamal Srivastava, Pallavi Jain, Gur Saran

Publication date: 10 April 2018

Full work available at URL: https://arxiv.org/abs/1702.05710

zbMATH Keywords

construction heuristics; graph layout; vertex separation

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C12: Distance in graphs

05C62: Graph representations (geometric and intersection representations, etc.)