Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs

DOI10.1137/S0097539792224814MaRDI QIDQ4229420zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 22 February 1999

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539792224814

zbMATH Keywords

graph theoryanalysis of algorithmsgraph partitioningmodular decompositioninterval graphchordal graphtransitive orientationtriangulated graphgraph recognitionsubstitution decompositioncardinality lexicographic orderingcycle-free poset

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1003286
• scientific article; zbMATH DE number 4049085
• scientific article; zbMATH DE number 512914
• Construction of a simple elimination scheme for a chordal comparability graph in linear time
• An Incremental Linear-Time Algorithm for Recognizing Interval Graphs

Cited in

(19)

• Organizing the atoms of the clique separator decomposition into an atom tree
• Interval graph representation with given interval and intersection lengths
• Linear-time algorithms for tree root problems
• An implicit representation of chordal comparability graphs in linear time
• Representing a concept lattice by a graph
• A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
• Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
• Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Modular decomposition and transitive orientation
• A simple algorithm to find Hamiltonian cycles in proper interval graphs
• Computing the clique-separator graph for an interval graph in linear time
• Construction of a simple elimination scheme for a chordal comparability graph in linear time
• Happy set problem on subclasses of co-comparability graphs
• Fast algorithms of dually chordal graphs
• An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
• A fully dynamic graph algorithm for recognizing interval graphs
• Happy set problem on subclasses of co-comparability graphs
• A local approach to concept generation
• Fully dynamic representations of interval graphs

This page was built for publication: Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs

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