On the representability of totally unimodular matrices on bidirected graphs (Q1044979): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Leonidas S. Pitsoulis / rank
Normal rank
 
Property / author
 
Property / author: Gautam M. Appa / rank
Normal rank
 
Property / author
 
Property / author: Leonidas S. Pitsoulis / rank
 
Normal rank
Property / author
 
Property / author: Gautam M. Appa / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012084603 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0901.0885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bidirected generalization of network matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting Linear Programs to Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm that proves half‐integrality of bidirected network programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cographic matroids and signed-graphic matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Whether a Given Binary Matroid is Graphic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:51, 2 July 2024

scientific article
Language Label Description Also known as
English
On the representability of totally unimodular matrices on bidirected graphs
scientific article

    Statements

    On the representability of totally unimodular matrices on bidirected graphs (English)
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    network matrices
    0 references
    binet matrices
    0 references
    bidirected graphs
    0 references
    matroid decomposition
    0 references
    signed-graphic matroids
    0 references

    Identifiers