scientific article; zbMATH DE number 432770
From MaRDI portal
Publication:3138899
Cited in
(23)- Combinatorial algorithms for feedback problems in directed graphs
- Edge crossings in drawings of bipartite graphs
- Approximations for the maximum acyclic subgraph problem
- Food webs: experts consuming families of experts
- Crossing-constrained hierarchical drawings
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Decentralized state observers for range-based position and velocity estimation in acyclic formations with fixed topologies
- Restricted common superstring and restricted common supersequence
- The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
- Decentralized H₂ observers for position and velocity estimation in vehicle formations with fixed topologies
- An exact method for the minimum feedback arc set problem
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
- Extremal results on feedback arc sets in digraphs
- Effective Computation of a Feedback Arc Set Using PageRank
- Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
- Efficient heuristics to compute minimal and stable feedback arc sets
- Hochschild homology, and a persistent approach via connectivity digraphs
- Asymptotic lower bounds for the feedback arc set problem in random graphs
- A fast and effective heuristic for the feedback arc set problem
- Finding small feedback arc sets on large graphs
- Exact localisations of feedback sets
- Upper bounds on the minimum size of feedback arc set of directed multigraphs with bounded degree
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
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)
