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
Discussion
View source
View history
Purge
English
Log in

Improved complexity for power edge set problem

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

DOI10.1007/978-3-319-78825-8_11zbMath1504.68159OpenAlexW2788348440MaRDI QIDQ1642691

Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Matthias Weller

Publication date: 15 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-78825-8_11



Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)


Related Items (1)

Complexity and lowers bounds for power edge set problem







This page was built for publication: Improved complexity for power edge set problem

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