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

A note on the approximability of the dense subgraph problem.

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

zbMath1067.68078MaRDI QIDQ1776068

O. V. Verbitskiĭ

Publication date: 20 May 2005

Published in: Matematychni Studiï (Search for Journal in Brave)


zbMATH Keywords

optimizationapproximate solutiondense subgraph problem


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)


Related Items (1)

Sensor network localization, Euclidean distance matrix completions, and graph realization






This page was built for publication: A note on the approximability of the dense subgraph problem.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1776068&oldid=14119959"
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 07:42.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki