Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks (Q2568262): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 07:59, 3 February 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks
scientific article

    Statements

    Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks (English)
    0 references
    0 references
    10 October 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Undirected network
    0 references
    Directed network
    0 references
    LOP
    0 references
    WFQ
    0 references
    Convex-bipartite networks
    0 references
    Convex-split networks
    0 references