scientific article; zbMATH DE number 6472575

zbMATH Open1321.05255MaRDI QIDQ5501779FDOQ5501779

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

Publication date: 14 August 2015

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (14)

• A distance measure for large graphs based on prime graphs
• Cograph editing: Merging modules is equivalent to editing P_4s
• A note on transitive orientations with maximum sets of sources and sinks
• Polynomial-time recognition of clique-width \(\leq 3\) graphs
• Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
• 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
• Title not available (Why is that?)
• 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
• Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
• Stability number of bull- and chair-free graphs revisited
• Triangulating graphs with few \(P_4\)'s
• Recognition of some perfectly orderable graph classes

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)