A measure of parallelization for the lexicographically first maximal subgraph problems

DOI10.1007/BFB0024508MaRDI QIDQ4373691zbMATH OpenFDO

Authors Ryuhei Uehara

Publication date 23 June 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0024508

zbMATH Keywords

maximum directed tree size

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A measure for the lexicographically first maximal independent set problem and its limits
• scientific article; zbMATH DE number 17799
• scientific article; zbMATH DE number 4060745
• The lexicographically first maximal subgraph problems:P-completeness andNC algorithms

Cited in

(5)

• scientific article; zbMATH DE number 4060745 (Why is no real title available?)
• scientific article; zbMATH DE number 17799 (Why is no real title available?)
• scientific article; zbMATH DE number 562727 (Why is no real title available?)
• A measure for the lexicographically first maximal independent set problem and its limits
• The computational complexity of factored graphs

This page was built for publication: A measure of parallelization for the lexicographically first maximal subgraph problems

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