Incorporating negative-weight vertices in certain vertex-search graph algorithms

DOI10.1016/0020-0190(92)90224-JzbMath0764.68127OpenAlexW2046640956MaRDI QIDQ1198080

Terrance A. Mankus, Glenn K. Manacher

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90224-j

zbMATH Keywords

vertex-search graph algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Dominations in trapezoid graphs ⋮ Parallel algorithms for the domination problems in trapezoid graphs ⋮ Weighted domination of cocomparability graphs

Cites Work

• Unnamed Item
• On a circle-cover minimization problem
• A unified approach to domination problems on interval graphs
• Domination in permutation graphs
• Total Domination and Irredundance in Weighted Interval Graphs
• Total domination in graphs
• An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph

This page was built for publication: Incorporating negative-weight vertices in certain vertex-search graph algorithms