Graph Orientations Optimizing the Number of Light or Heavy Vertices

DOI10.1007/978-3-642-32147-4_30zbMath1370.68116OpenAlexW151105204MaRDI QIDQ5894978

Jesper Jansson, Yuichi Asahiro, Hirotaka Ono, Eiji Miyano

Publication date: 2 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_30

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On finding orientations with the fewest number of vertices with small out-degree ⋮ Degree-constrained graph orientation: maximum satisfaction and minimum violation

This page was built for publication: Graph Orientations Optimizing the Number of Light or Heavy Vertices