Approximation Algorithms for Orienting Mixed Graphs

DOI10.1007/978-3-642-21458-5_35zbMath1339.68315OpenAlexW2149458512MaRDI QIDQ3011872

Dana Silverbush, Colin R. Davidson, Roded Sharan, Michael Elberfeld, Danny Segev

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_35

zbMATH Keywords

approximation algorithmmixed graphgraph orientationprotein-protein interaction network

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20) Systems biology, networks (92C42)

Related Items (1)

A note on the parameterized complexity of unordered maximum tree orientation

Cites Work

• Unnamed Item
• Unnamed Item
• Orienting graphs to optimize reachability
• Improved algorithms for feedback vertex set problems
• A note on finding the bridges of a graph
• Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs
• Strongly connected orientations of mixed multigraphs
• Robbins's Theorem for Mixed Multigraphs
• The Structure and Function of Complex Networks
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• Improved Orientations of Physical Networks
• Some optimal inapproximability results
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• A note on orientations of mixed graphs

This page was built for publication: Approximation Algorithms for Orienting Mixed Graphs