scientific article; zbMATH DE number 432770
From MaRDI portal
Publication:3138899
zbMATH Open0800.68607MaRDI QIDQ3138899FDOQ3138899
Authors: Bonnie Berger, Peter W. Shor 
Publication date: 19 September 1994
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (20)
- A fast and effective heuristic for the feedback arc set problem
- Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
- Combinatorial algorithms for feedback problems in directed graphs
- Exact localisations of feedback sets
- Restricted common superstring and restricted common supersequence
- Decentralized \(H_2\) observers for position and velocity estimation in vehicle formations with fixed topologies
- Effective Computation of a Feedback Arc Set Using PageRank
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- An exact method for the minimum feedback arc set problem
- The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
- Hochschild homology, and a persistent approach via connectivity digraphs
- Efficient heuristics to compute minimal and stable feedback arc sets
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Food webs: experts consuming families of experts
- Edge crossings in drawings of bipartite graphs
- Approximations for the maximum acyclic subgraph problem
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
- Extremal results on feedback arc sets in digraphs
- Decentralized state observers for range-based position and velocity estimation in acyclic formations with fixed topologies
- Crossing-constrained hierarchical drawings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138899)
