A Class of Balanced Matrices Arising from Location Problems (Q3222208): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially bounded algorithms for locatingp-centers on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect zero–one matrices / rank
 
Normal rank

Latest revision as of 15:47, 14 June 2024

scientific article
Language Label Description Also known as
English
A Class of Balanced Matrices Arising from Location Problems
scientific article

    Statements

    A Class of Balanced Matrices Arising from Location Problems (English)
    0 references
    0 references
    1983
    0 references
    balanced incidence matrices
    0 references
    intersection graphs
    0 references
    subtrees
    0 references
    triangulated graphs
    0 references
    neighbourhood subtree
    0 references

    Identifiers