Pages that link to "Item:Q1242450"

The following pages link to Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450):

Displaying 16 items.

• Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
• Common intervals of multiple permutations (Q534763) (← links)
• Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
• A branch-and-cut approach to the crossing number problem (Q951113) (← links)
• Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
• Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
• Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
• On coalescence analysis using genealogy rooted trees (Q2262416) (← links)
• Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
• Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
• Minimising the number of gap-zeros in binary matrices (Q2355802) (← links)
• On edge intersection graphs of paths with 2 bends (Q2357780) (← links)
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
• Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
• Triangulating planar graphs while minimizing the maximum degree (Q5056146) (← links)
• PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT (Q5248997) (← links)