scientific article
From MaRDI portal
Publication:3138899
zbMath0800.68607MaRDI QIDQ3138899
Publication date: 19 September 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Approximations for the maximum acyclic subgraph problem ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem ⋮ An Exact Method for the Minimum Feedback Arc Set Problem ⋮ Extremal results on feedback arc sets in digraphs ⋮ Effective Computation of a Feedback Arc Set Using PageRank ⋮ Food webs: experts consuming families of experts ⋮ Decentralized \(H_2\) observers for position and velocity estimation in vehicle formations with fixed topologies ⋮ Crossing-constrained hierarchical drawings ⋮ Restricted Common Superstring and Restricted Common Supersequence ⋮ A fast and effective heuristic for the feedback arc set problem ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Exact localisations of feedback sets ⋮ Decentralized state observers for range-based position and velocity estimation in acyclic formations with fixed topologies ⋮ Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs ⋮ Combinatorial algorithms for feedback problems in directed graphs ⋮ Edge crossings in drawings of bipartite graphs
