Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\)

DOI10.1016/0304-3975(96)00014-XzbMath0872.68136OpenAlexW2094882771MaRDI QIDQ1351969

Andrea E. F. Clementi, José D. P. Rolim, Alexander E. Andreev

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(96)00014-x

Mathematics Subject Classification ID

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

Cites Work

• Ordered vertex removal and subgraph problems
• The complexity of colouring problems on dense graphs
• The parallel complexity of approximating the high degree subgraph problem
• On the structure of linear graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\)