Efficient algorithms for finding critical subgraphs

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

Publication:2467361

DOI10.1016/J.DAM.2006.07.019zbMATH Open1130.05055OpenAlexW2034904496MaRDI QIDQ2467361

Author name not available (Why is that?)

Publication date: 21 January 2008

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.07.019



zbMATH Keywords

No records found.


Mathematics Subject Classification ID

No records found.








This page was built for publication: Efficient algorithms for finding critical subgraphs

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

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