Pages that link to "Item:Q1962057"

The following pages link to A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057):

Displaying 19 items.

• Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
• Minimal triangulations of graphs: a survey (Q819823) (← links)
• Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs (Q861797) (← links)
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
• Characterizing and computing minimal cograph completions (Q972335) (← links)
• Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
• Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
• Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (Q1706124) (← links)
• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
• Equistable distance-hereditary graphs (Q2473043) (← links)
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
• BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES (Q2905308) (← links)
• Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
• Fast and simple algorithms for counting dominating sets in distance-hereditary graphs (Q5012812) (← links)
• (Q5150424) (← links)
• (Q5150500) (← links)
• Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
• Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
• Twin-distance-hereditary digraphs (Q6132965) (← links)