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

scientific article; zbMATH DE number 1310280

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

DOI<189::AID-NET5>3.0.CO;2-2 10.1002/(SICI)1097-0037(199905)33:3<189::AID-NET5>3.0.CO;2-2zbMath0923.05045MaRDI QIDQ4254354

Bettina Klinz, Gerhard J. Woeginger

Publication date: 29 June 1999


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

optimum algorithmbottleneck graph partition problem


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (2)

Models and methods for solving the problem of network vulnerability ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum



Cites Work

  • Some simplified NP-complete graph problems
  • Unnamed Item


This page was built for publication:

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