Pages that link to "Item:Q4229420"

The following pages link to Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs (Q4229420):

Displaying 15 items.

• Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
• Interval graph representation with given interval and intersection lengths (Q491160) (← links)
• An implicit representation of chordal comparability graphs in linear time (Q972319) (← links)
• A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
• Construction of a simple elimination scheme for a chordal comparability graph in linear time (Q1283807) (← links)
• Modular decomposition and transitive orientation (Q1301738) (← links)
• Fully dynamic representations of interval graphs (Q1711837) (← links)
• Representing a concept lattice by a graph (Q1885806) (← links)
• A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
• Happy set problem on subclasses of co-comparability graphs (Q2154092) (← links)
• Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation (Q2254614) (← links)
• Linear-time algorithms for tree root problems (Q2346968) (← links)
• A local approach to concept generation (Q2385441) (← links)
• Computing the clique-separator graph for an interval graph in linear time (Q2628270) (← links)
• Happy set problem on subclasses of co-comparability graphs (Q6069926) (← links)