Vertex ranking of asteroidal triple-free graphs

DOI10.1016/S0020-0190(98)00162-8zbMATH Open1339.05395OpenAlexW2005655086MaRDI QIDQ293448FDOQ293448

C. K. Wong, Haiko Müller, Ton Kloks

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001628?np=y

Recommendations

• Vertex ranking of asteroidal triple-free graphs
• Asteroidal Triple-Free Graphs
• Asteroidal triple-free graphs
• Vertex ordering characterizations of graphs of bounded asteroidal number
• Asteroidal-triple-free interval \(k\)-graphs
• scientific article; zbMATH DE number 1522927
• Domination and total domination on asteroidal triple-free graphs
• scientific article; zbMATH DE number 2191988
• Induced matchings in asteroidal triple-free graphs
• Publication:4944994

zbMATH Keywords

graph algorithmsvertex rankingasteroidal triple-free graphminimal separator

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Rankings of Graphs
• Representation of a finite graph by a set of intervals on the real line
• The Complexity of the Partial Order Dimension Problem
• Asteroidal Triple-Free Graphs
• On a graph partition problem with application to VLSI layout
• Finding minimum height elimination trees for interval graphs in polynomial time
• Measuring the vulnerability for classes of intersection graphs
• Optimal node ranking of tree in linear time
• Ordered colourings
• The Role of Elimination Trees in Sparse Factorization
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Listing all Minimal Separators of a Graph
• Treewidth and Pathwidth of Permutation Graphs
• Title not available (Why is that?)

Cited In (10)

• On the vertex ranking problem for trapezoid, circular-arc and other graphs
• An optimal parallel algorithm forc-vertex-ranking of trees
• Rank numbers for bent ladders
• Rank numbers of grid graphs
• Optimal vertex ranking of block graphs
• Vertex ranking of asteroidal triple-free graphs
• Constructing a minimum height elimination tree of a tree in linear time
• Max-optimal and sum-optimal labelings of graphs
• Computing tree-depth faster than \(2^n\)
• Rank numbers for some trees and unicyclic graphs

This page was built for publication: Vertex ranking of asteroidal triple-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293448)