MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS

DOI10.1080/16073606.1993.9631742MaRDI QIDQ4288050zbMATH OpenOpenAlexFDO

Authors Terri Wilhite Johnson, Peter Slater

Publication date 21 April 1994

Published in Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/16073606.1993.9631742

zbMATH Keywords

maximum independent setminimum total redundanceNP-hardseries-parallel graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 4150229
• The complexity of some problems on maximal independent sets in graphs
• Maximum independent sets in graphs of low degree
• Independence and irredundance in \(k\)-regular graphs
• On disjoint maximal independent sets in graphs

Cites work

• A linear algorithm for the domination number of a series-parallel graph
• A recurrence template for several parameters in series-parallel graphs
• Depth-First Search and Linear Graph Algorithms
• Graph minors. II. Algorithmic aspects of tree-width
• Graph-theoretic parameters concerning domination, independence, and irredundance
• scientific article; zbMATH DE number 3837386 (Why is no real title available?)
• scientific article; zbMATH DE number 4095510 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Some simplified NP-complete graph problems

Cited in

(3)

• A recurrence template for several parameters in series-parallel graphs
• Maximum series-parallel subgraph
• scientific article; zbMATH DE number 4150229 (Why is no real title available?)

This page was built for publication: MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS

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