Minimum degree orderings (Q848936): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-008-9239-2 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-008-9239-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170044697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correctness certificate for the Stoer-Wagner min-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Undirected Edge Connectivity in Õ(n2) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts in near-linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the minimum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutsets and partitions of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i>-Components, Clusters and Slicings in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(&lt;Special Issue&gt;Network Design, Control and Optimization) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost subpartitions in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Optimally Increasing the Edge Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing symmetric submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Cost Source Location Problems with Flow Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity augmentation problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-008-9239-2 / rank
 
Normal rank

Latest revision as of 05:14, 10 December 2024

scientific article
Language Label Description Also known as
English
Minimum degree orderings
scientific article

    Statements

    Minimum degree orderings (English)
    0 references
    0 references
    0 references
    23 February 2010
    0 references
    edge-connectivity
    0 references
    extreme subsets
    0 references
    graph algorithms
    0 references
    maximum adjacency orderings
    0 references
    minimum cuts
    0 references
    minimum degree orderings
    0 references
    submodular functions
    0 references
    posi-modular functions
    0 references

    Identifiers