Name
Abstract | ||
|---|---|---|
We exhibite a polynomial algorithm which, given a cubic graph with positive weights on the edges, finds a maximal edge-cut(whose total weight may not be improved by moving a single vertex from one “side” of the cut to the other “side”). |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/3-540-54233-7_147 | ICALP |
Keywords | Field | DocType |
efficient maximal cubic graph,extended abstract,cubic graph | Discrete mathematics,Combinatorics,Gray graph,Polyhedral graph,Cubic graph,Foster graph,Regular graph,Desargues graph,Distance-regular graph,Mathematics,Voltage graph | Conference |
Volume | ISSN | ISBN |
510 | 0302-9743 | 0-387-54233-7 |
Citations | PageRank | References |
5 | 0.81 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Loebl | 1 | 152 | 28.66 |