Pages that link to "Item:Q2768336"
From MaRDI portal
The following pages link to A polynomial time recognition algorithm for probe interval graphs (Q2768336):
Displaying 21 items.
- Adjacency matrices of probe interval graphs (Q608289) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- On the bi-enhancement of chordal-bipartite probe graphs (Q991750) (← links)
- Recognizing edge clique graphs among interval graphs and probe interval graphs (Q998556) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- A characterization of cycle-free unit probe interval graphs (Q1028472) (← links)
- Chordal probe graphs (Q1887057) (← links)
- Mining CSTNUDs significant for a set of traces is polynomial (Q2051798) (← links)
- Good characterizations and linear time recognition for 2-probe block graphs (Q2403805) (← links)
- Characterizing interval graphs which are probe unit interval graphs (Q2416421) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- 2-tree probe interval graphs have a large obstruction set (Q2565858) (← links)
- Recognition of Probe Ptolemaic Graphs (Q3000516) (← links)
- Characterisations and Linear-Time Recognition of Probe Cographs (Q3508570) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs (Q5056152) (← links)
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns (Q5425421) (← links)
- Algorithms and Computation (Q5712172) (← links)
- Linear-Time Recognition of Probe Interval Graphs (Q5899485) (← links)
