A survey of graph layout problems-Reference-Cited by-同舟云学术

A survey of graph layout problems

Published:2002-09 Issue:3 Volume:34 Page:313-356
ISSN:0360-0300
Container-title:ACM Computing Surveys
language:en
Short-container-title:ACM Comput. Surv.

Author:

Díaz Josep¹,Petit Jordi¹,Serna Maria¹

Affiliation:

1. Universitat Politècnica de Catalunya, Barcelona

Abstract

Graph layout problems are a particular class of combinatorial optimization problems whose goal is to find a linear layout of an input graph in such way that a certain objective cost is optimized. This survey considers their motivation, complexity, approximation properties, upper and lower bounds, heuristics and probabilistic analysis on random graphs. The result is a complete view of the current state of the art with respect to layout problems from an algorithmic point of view.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/568522.568523

Reference251 articles.

1. Single machine job sequencing with precedence constraints;Adolphson D.;SIAM J. Comput.,1977

2. Optimal linear ordering;Adolphson D.;SIAM J. Appl. Mathem.,1973

3. λ1, isoperimetric inequalities for graphs and superconcentrators;Alon N.;J. Combinatorial Theory. Series B,1985

Cited by 372 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Strong SDP based bounds on the cutwidth of a graph;Computers & Operations Research;2024-01

2. Hardness and approximation of submodular minimum linear ordering problems;Mathematical Programming;2023-12-14

3. Finding community structure using the ordered random graph model;Physical Review E;2023-07-07

4. Exact and rapid linear clustering of networks with dynamic programming;Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences;2023-07

5. Population-based iterated greedy algorithm for the S-labeling problem;Computers & Operations Research;2023-07