Network flow and 2-satisfiability (Q1317481): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56288400, #quickstatements; #temporary_batch_1710976035288
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved Time Bounds for the Maximum Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum-Cost Circulations by Successive Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Fast Algorithms for Four Problems in Stable Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric stable marriage and minimum cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every finite distributive lattice is a set of stable matchings for a small stable marriage instance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent approximation algorithms for node cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounded approximation for the minimum cost 2-sat problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Stable Marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On likely solutions of a stable marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance analysis of voting strategies for a fly-by-wire system of a fighter aircraft / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank

Latest revision as of 12:40, 22 May 2024

scientific article
Language Label Description Also known as
English
Network flow and 2-satisfiability
scientific article

    Statements

    Network flow and 2-satisfiability (English)
    0 references
    0 references
    0 references
    11 September 1994
    0 references
    network flow
    0 references
    2-satisfiability
    0 references
    stable matching
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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