Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks

DOI10.1016/j.ins.2004.11.008zbMath1087.68010OpenAlexW2031738458MaRDI QIDQ2568262

Shin-Jer Yang

Publication date: 10 October 2005

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2004.11.008

zbMATH Keywords

LOPWFQConvex-bipartite networksConvex-split networksDirected networkUndirected network

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Linear-time algorithm for the paired-domination problem in convex bipartite graphs

Cites Work

• Polynomial auction algorithms for shortest paths
• Algorithms for a Core and k-Tree Core of a Tree
• A reflective infrastructure for workflow adaptability
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks