• Corpus ID: 13371883


  author={Peter Eades},
  • P. Eades
  • Published 1993
  • Mathematics, Computer Science
Let G V A denote a simple connected directed graph and let n jV j m jAj where n m n A feedback arc set FAS of G denoted R G is a possibly empty set of arcs whose reversal makes G acyclic A minimum feedback arc set of G denoted R G is a FAS of minimum cardinality r G the computa tion of R G is called the FAS problem For every n let n denote the maximum over all digraphs G of order n of jR G j Berger and Shor have recently published an algorithm which for a given digraph G computes a FAS whose… 

Exact Elimination of Cycles in Graphs

  • D. RaibleH. Fernau
  • Mathematics
    Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs
  • 2007
This work examines a graph class called (1,n)-graphs, which contains cubic graphs, and discusses exact and parameterized algorithms, where the parameterized algorithm is of special interest, as it is not an amortization analysis modelled by 'finite states' but is rather a 'top-down' amortized analysis.

Upward planarization and layout

A novel upward planarization approach for upward crossing minimization of DAGs that utilizes new ideas for subgraph computation and arc reinsertion and a new layout approach for realizing UPRs, that is, a drawing algorithm for constructing upward drawings where the arc crossings arising in the drawing are the ones modeled by the dummy nodes in R.

Computing Quasi-Upward Planar Drawings of Mixed Graphs

This work describes both efficient heuristic techniques and exact approaches for computing quasi-upward planar drawings of embedded mixed graphs with few bends, and extensively compare them experimentally: the results suggest that the algorithms are effective in many cases.

Trading routing diversity for better network performance

FlexCut is introduced, a flexible approach for cutting off wireless links, which essentially limits the candidate forwarder set of each node, and can trade arbitrary amounts of routing diversity for better network performance by exposing to network operators a parameter which quantifies the aggressiveness.

How Good is Weak-Stabilization?

This paper investigates a metric for characterizing the recovery time of weak-stabilizing algorithms, based on expected mean value of recovery steps for resuming a correct behavior, and introduces an automated technique that can improve the performance of implementation ofWeak-st stabilizing algorithms through state encoding.

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings

The results of this study suggest that OOD can be effectively exploited to perform some basic tasks of analysis in a faster and more accurate way when compared to other drawing styles for directed graphs.

NetFork: Mapping Time to Space in Network Visualization

NetFork is described, a system that conveys the timings and the impact of path changes that occur in a routing network by suitable time-to-space metaphors, without relying on the time- to-time mapping adopted by the play-back interfaces of alternative network monitoring tools.

SCARPA: scaffolding reads with practical algorithms

It is shown that SCARPA produces longer or similar length scaffolds that are highly accurate compared with other scaffolders, and is also capable of detecting misassembled contigs and reports them during scaffolding.

OZONE: Package Layered Structure Identification in presence of Cycles

An approach which provides a strategy to highlight dependencies which break Acyclic Dependency Principle and an organization of package (even in presence of cycles) in multiple layers is proposed, which shows promising results.

Privacy Preserving Recommendation System Based on Groups

A privacy preserving recommendation framework based on groups is presented to use groups as a natural middleware to preserve users’ privacy and a distributed preference exchange algorithm is proposed to ensure the anonymity of data.



Approximation alogorithms for the maximum acyclic subgraph problem

It is found that all graphs without two-cycles contain large acyclic subgraphs, a fact which was not previously known.

On Sets of Consistent Arcs in a Tournament

A (round-robin) tournament Tn consists n of nodes u1, u2, …, un such that each pair of distinct nodes ui and uj is joined by one of the (oriented) arcs or The arcs in some set S are said to be

Optimal ranking of tournaments

Let us be given a tournament Tn (i-e., a complete directed graph) on n players. It is natural to look for a ranking (linear order) L on the n players that best reflects the tournament result.

Reducibility among combinatorial problems" in complexity of computer computations

In his 1972 paper, Reducibility Among Combinatorial Problems, Richard Karp used Stephen Cooks 1971 theorem that the boolean satisfiability problem is.

Inconsistencies in a schedule of paired comparisons

1. THE METHOD, AND THE HYPOTHESES CONCERNING IT The method of paired comparison has had a long and honourable history in psychological experiments, beginning with the researches of Witmer and Cohn,

Analysis of Algorithms for Drawing Graphs

  • Analysis of Algorithms for Drawing Graphs
  • 1992

ACKNOWLEDGEMENT The work of the third author was supported in part by Grant No

  • A8180 of the Natural Sciences and Engineering Research Council of Canada

On subgraphs without cycles in tournaments, Combinatorial Theory & Its Applications II

  • On subgraphs without cycles in tournaments, Combinatorial Theory & Its Applications II
  • 1970