The following pages link to (Q4190666):
Displaying 8 items.
- Fast recognition of classes of almost-median graphs (Q864135) (← links)
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs (Q1144938) (← links)
- A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs (Q1263968) (← links)
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- Determining outerplanarity using segment graphs (Q3659805) (← links)
- Uniquely colorable graphs up to automorphisms (Q6160596) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)
