Pages that link to "Item:Q2440119"
From MaRDI portal
The following pages link to Recognition of probe proper interval graphs (Q2440119):
Displaying 13 items.
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- On probe interval graphs (Q1281778) (← links)
- Characterizing interval graphs which are probe unit interval graphs (Q2416421) (← links)
- A polynomial time recognition algorithm for probe interval graphs (Q2768336) (← links)
- Recognition of Probe Ptolemaic Graphs (Q3000516) (← links)
- On partitioning interval graphs into proper interval subgraphs and related problems (Q3174235) (← links)
- (Q4590888) (← links)
- Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
- (Q5075828) (← links)
- STACS 2005 (Q5710704) (← links)
- Linear-Time Recognition of Probe Interval Graphs (Q5899485) (← links)
- LATIN 2004: Theoretical Informatics (Q5901633) (← links)
- On characterization and recognition of proper tagged probe interval graphs (Q6641094) (← links)