An exact combinatorial algorithm for minimum graph bisection
Delling, Daniel ; Fleischman, Daniel ; Goldberg, Andrew V. ; Razenshteyn, Ilya ; Werneck, Renato F.
- Link zu diesem Datensatz
- https://d-nb.info/1194148530
- Titel
- An exact combinatorial algorithm for minimum graph bisection
- Art des Inhalts
- Teil eines Werks
- Verfassangaben
- by Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya Razenshteyn, Renato F. Werneck
- Autor(en)
-
- Delling, Daniel
- Fleischman, Daniel
- Goldberg, Andrew V.
- Razenshteyn, Ilya
- Werneck, Renato F.
- Organisation(en)
-
- SpringerLink (Online service)
- Zeitliche Einordnung
- Erscheinungsdatum: 2014
- Umfang/Format
- Online-Ressource
- ISSN
14364646- DOI
- 10.1007/s10107-014-0811-z
- Online
- https://doi.org/10.1007/s10107-014-0811-z
- Sprache
- eng
- Schlagwörter
-
- (lcsh)Computer science--Mathematics.
- (lcsh)Numerical analysis.
- (lcsh)Calculus of variations.
- (lcsh)Combinatorics.
- (lcsh)Physics.
- Calculus of Variations and Optimal Control
- Optimization.
- Mathematics of Computing.
- Numerical Analysis.
- Combinatorics.
- Theoretical, Mathematical and Computational Physics.
- Mathematical Methods in Physics.
- Frühere/spätere Titel
-
- Enthalten in: Mathematical programming
- Enthalten in: Mathematical programming
- Enthalten in: Mathematical programming
- Stand
- 01.06.2021 18:33
- Im Katalog seit
- 07.03.2026