scientific article; zbMATH DE number 6472575
From MaRDI portal
Publication:5501779
zbMath1321.05255MaRDI QIDQ5501779
Jens Gustedt, Elias Dahlhaus, Ross M. McConnell
Publication date: 14 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
A note on transitive orientations with maximum sets of sources and sinks ⋮ Unnamed Item ⋮ Weighted parameters in \((P_5,\overline {P_5})\)-free graphs ⋮ Polynomial-time recognition of clique-width \(\leq 3\) graphs ⋮ Stability number of bull- and chair-free graphs revisited ⋮ Cograph editing: Merging modules is equivalent to editing P_4s ⋮ \(N\)-extendible posets, and how to minimize total weighted completion time ⋮ A fully dynamic algorithm for modular decomposition and recognition of cographs. ⋮ A distance measure for large graphs based on prime graphs ⋮ Recognition of some perfectly orderable graph classes ⋮ Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes ⋮ Triangulating graphs with few \(P_4\)'s ⋮ Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing ⋮ Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
This page was built for publication:
