- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Generating Cut Conjunctions in Graphs and Related Problems ; volume:51 ; number:3 ; day:27 ; month:10 ; year:2007 ; pages:239-263 ; date:7.2008
Algorithmica ; 51, Heft 3 (27.10.2007), 239-263, 7.2008
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-007-9111-9
- URN
-
urn:nbn:de:101:1-2021082318455094507996
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:59 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Khachiyan, Leonid
- Boros, Endre
- Borys, Konrad
- Elbassioni, Khaled
- Gurvich, Vladimir
- Makino, Kazuhisa
- SpringerLink (Online service)
Other Objects (12)
Cut problems on graphs
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
The Cheeger cut and Cheeger problem in metric graphs
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
Domination and cut problems on chordal graphs with bounded leafage
Domination and cut problems on chordal graphs with bounded leafage
Generating Outerplanar Graphs Uniformly at Random
Generating random knowledge graphs from rules
Faster Cut Sparsification of Weighted Graphs
Scheduling and related graph theoretical problems
Scheduling and related graph theoretical problems
On problems related to graph colouring
Cut problems on graphs
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
The Cheeger cut and Cheeger problem in metric graphs
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
Domination and cut problems on chordal graphs with bounded leafage
Domination and cut problems on chordal graphs with bounded leafage
Generating Outerplanar Graphs Uniformly at Random
Generating random knowledge graphs from rules
Faster Cut Sparsification of Weighted Graphs
Scheduling and related graph theoretical problems
Scheduling and related graph theoretical problems
On problems related to graph colouring
Cut problems on graphs
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering
The Cheeger cut and Cheeger problem in metric graphs
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
Domination and cut problems on chordal graphs with bounded leafage
Domination and cut problems on chordal graphs with bounded leafage
Generating Outerplanar Graphs Uniformly at Random
Generating random knowledge graphs from rules
Faster Cut Sparsification of Weighted Graphs
Scheduling and related graph theoretical problems
Scheduling and related graph theoretical problems