scientific article; zbMATH DE number 1500541

zbMATH Open0962.68134MaRDI QIDQ4501560FDOQ4501560

Authors: Jean-Marc Lanlignel, Olivier Raynaud, Eric Thierry 

Publication date: 4 September 2000

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

Recommendations

• A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
• Dynamic Distance Hereditary Graphs Using Split Decomposition
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• The path-partition problem in bipartite distance-hereditary graphs
• scientific article; zbMATH DE number 815104

zbMATH Keywords

data structurepruned graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cited In (4)

• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
• Title not available (Why is that?)
• Equistable distance-hereditary graphs
• Computing maximum stable sets for distance-hereditary 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 Q4501560)