Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (Q867855): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2006.04.032 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.04.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007143256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient network flow code for finding all minimum cost \(s-t\) cutsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting maximal information about sets of minimum cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for enumerating all spanning trees of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Network Reliability in Time Polynomial in the Number of Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A paradigm for listing \((s,t)\)-cuts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for enumerating all directed spanning trees in a directed graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2006.04.032 / rank
 
Normal rank

Latest revision as of 06:10, 10 December 2024

scientific article
Language Label Description Also known as
English
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references