Perfect matching interdiction problem restricted to a stable vertex (Q1794725): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129250125, #quickstatements; #temporary_batch_1724888006188
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: The multi-terminal maximum-flow network-interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-level programming and conflict resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most vital links and nodes in weighted networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nodal interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interdiction of a supply network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>n</i> Most Vital Links in Flow Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow interdiction on planar graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129250125 / rank
 
Normal rank

Revision as of 00:39, 29 August 2024

scientific article
Language Label Description Also known as
English
Perfect matching interdiction problem restricted to a stable vertex
scientific article

    Statements

    Identifiers