Pages that link to "Item:Q1242450"
From MaRDI portal
The following pages link to Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450):
Displaying 50 items.
- A fast algorithm for maximum integral two-commodity flow in planar graphs (Q1314324) (← links)
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) (← links)
- Finding the closed partition of a planar graph (Q1322561) (← links)
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs (Q1322567) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Recognition of \(d\)-dimensional Monge arrays (Q1329798) (← links)
- Algorithms for interval catch digraphs (Q1329814) (← links)
- Arboricity and bipartite subgraph listing algorithms (Q1334644) (← links)
- Characterizations of two classes of digraphs (Q1336693) (← links)
- Planarity testing in parallel (Q1342859) (← links)
- Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072) (← links)
- Proper interval graphs and the guard problem (Q1363667) (← links)
- Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- On minimum intersection of two minimum dominating sets of interval graphs (Q1377653) (← links)
- Recognition of Robinsonian dissimilarities (Q1378872) (← links)
- Unit disk graph recognition is NP-hard (Q1384186) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
- A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
- PC trees and circular-ones arrangements. (Q1401263) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- A selected tour of the theory of identification matrices (Q1575436) (← links)
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664) (← links)
- A genetic algorithm for determining the thickness of a graph (Q1602541) (← links)
- Reconstruction graphs and testing their properties in a relational spatial database (Q1609074) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- Testing a mixture model of single-peaked preferences (Q1642168) (← links)
- Secure domination in proper interval graphs (Q1671314) (← links)
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- A large set of torus obstructions and how they were discovered (Q1700776) (← links)
- Local and union boxicity (Q1709530) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- On the classes of interval graphs of limited nesting and count of lengths (Q1739103) (← links)
- The eternal dominating set problem for interval graphs (Q1739215) (← links)
- List matrix partitions of graphs representing geometric configurations (Q1741515) (← links)
- Dynamic monopolies for interval graphs with bounded thresholds (Q1741518) (← links)
- A simple algorithm for secure domination in proper interval graphs (Q1741524) (← links)
- Simultaneous embedding: edge orderings, relative positions, cutvertices (Q1751092) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- Hardness results on the gapped consecutive-ones property problem (Q1759853) (← links)
- Optimal linear arrangements using betweenness variables (Q1762457) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- Computing the branchwidth of interval graphs (Q1764810) (← links)
- Polynomial and APX-hard cases of the individual haplotyping problem (Q1781994) (← links)
- Parameterized algorithms for conflict-free colorings of graphs (Q1786593) (← links)
