scientific article; zbMATH DE number 6472575

MaRDI QIDQ5501779zbMATH OpenFDO

Authors Elias Dahlhaus, Jens Gustedt, R. M. McConnell

Publication date 14 August 2015

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Cited in

(14)

• Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
• Triangulating graphs with few \(P_4\)'s
• Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
• Stability number of bull- and chair-free graphs revisited
• A fully dynamic algorithm for modular decomposition and recognition of cographs.
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• A note on transitive orientations with maximum sets of sources and sinks
• Recognition of some perfectly orderable graph classes
• Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
• \(N\)-extendible posets, and how to minimize total weighted completion time
• Polynomial-time recognition of clique-width 3 graphs
• scientific article; zbMATH DE number 6963897 (Why is no real title available?)
• Cograph editing: Merging modules is equivalent to editing P₄s
• A distance measure for large graphs based on prime graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501779)