The following pages link to (Q5501779):
Displaying 14 items.
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs (Q1382285) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664) (← links)
- A note on transitive orientations with maximum sets of sources and sinks (Q1613367) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) (← links)
- \(N\)-extendible posets, and how to minimize total weighted completion time (Q1962041) (← links)
- (Q4691781) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
