Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs

From MaRDI portal
Publication:2938754
Jump to:navigation, search

DOI10.7155/JGAA.00339zbMath1320.68100OpenAlexW1987000624MaRDI QIDQ2938754

Yash Raj Shrestha, Jiong Guo

Publication date: 15 January 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00339



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)








This page was built for publication: Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2938754&oldid=15916668"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 20:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki