Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Kellogg S. Booth, George S. Lueker

Journal of Computer and System Sciences

Graph TheoryStructural Graph TheoryPlanar GraphInterval AnalysisInterval Computation +7

Complexity of network synchronization

Baruch Awerbuch

Journal of the ACM

Cluster ComputingEngineeringDistributed AlgorithmsNetwork AnalysisComputational Complexity +17

A Characterization of Comparability Graphs and of Interval Graphs

Paul C. Gilmore, Alan J. Hoffman

Canadian Journal of Mathematics

Mathematical ProgrammingComparability GraphsDirected GraphOrder TheoryEngineering +10

On sparse spanners of weighted graphs

Ingo Althöfer, Gautam Das, David Dobkin, +2

Discrete & Computational Geometry

Mathematical ProgrammingGraph SparsityNetwork ScienceGraph TheoryEngineering +7

Graph spanners

David Peleg, Alejandro A. Schäffer

Journal of Graph Theory

Graph SparsityNetwork ScienceGraph TheoryEngineeringSparse Spanners +8

The NP-Completeness of the bandwidth minimization problem

Ch. H. Papadimitriou

Computing

Mathematical ProgrammingEngineeringAlgorithmic Information TheoryBandwidth Minimization ProblemComputational Complexity +5

Edge Dominating Sets in Graphs

Mihalis Yannakakis, Fǎnicǎ Gavril

SIAM Journal on Applied Mathematics

Graph MinorEngineeringGraph TheoryExtremal Graph TheoryStructural Graph Theory +12

Complexity Results for Bandwidth Minimization

M. R. Garey, Ronald Graham, David S. Johnson, +1

SIAM Journal on Applied Mathematics

Graph SparsityDirected GraphEngineeringComputational ComplexityCommunication Complexity +14

Reconstructing the shape of a tree from observed dissimilarity data

Hans‐Jürgen Bandelt, Andreas Dress

Advances in Applied Mathematics

Geometric ModelingImage AnalysisEngineeringData ScienceNatural Sciences +9

There is a planar graph almost as good as the complete graph

Paul Chew

EngineeringGeometryPathfindingGlobal PlanningPlanar Graph +25