The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems

From MaRDI portal
Revision as of 17:29, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3854626

DOI10.1145/322154.322157zbMATH Open0421.68047OpenAlexW2051937719WikidataQ129991798 ScholiaQ129991798MaRDI QIDQ3854626

Author name not available (Why is that?)

Publication date: 1979

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322154.322157



zbMATH Keywords

No records found.


Mathematics Subject Classification ID

No records found.








This page was built for publication: The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems

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

Retrieved from "https://mardi.schubotz.org/w/index.php?title=Publication:3854626&oldid=17464978"
Powered by MediaWiki