Digraphs. Theory, algorithms and applications.
From MaRDI portal
See the review of the hardback edition (2001; Zbl 0958.05002).
Recommendations
- Digraphs. Theory, algorithms and applications
- Digraphs. Theory, algorithms and applications
- scientific article; zbMATH DE number 3503127
- scientific article; zbMATH DE number 53892
- Algorithmische Graphentheorie
- Algorithmische Graphentheorie
- Algorithmische Graphentheorie
- Graph theory. An introduction to proofs, algorithms, and applications
- scientific article; zbMATH DE number 1055145
Cited in
(only showing first 100 items - show all)- Returnability in complex directed networks (digraphs)
- A graph-theoretic perspective on the links-to-concepts ratio expected in cognitive maps
- On detour homogeneous digraphs
- On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\)
- Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity
- Adaptive coordinated attitude control for spacecraft formation with saturating actuators and unknown inertia
- Boundary vertices of Cartesian product of directed graphs
- k-distinct in- and out-branchings in digraphs
- Incentives and the structure of communication
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- On blow-ups and injectivity of quivers
- Critical kernel imperfect problem in generalizations of bipartite tournaments
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- Sufficient conditions for a digraph to admit a (1, )-identifying code
- Projective dimension and regularity of powers of edge ideals of vertex-weighted rooted forests
- A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs
- Game-perfect semiorientations of forests
- Disjoint cycles of different lengths in 3-regular digraphs
- NMR assignment through linear programming
- Implicit power indices for measuring indirect control in corporate structures
- On the fixed-parameter tractability of the maximum connectivity improvement problem
- \(k\)-ary spanning trees contained in tournaments
- Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs
- On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\)
- Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter
- Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
- The cycle structure for directed graphs on surfaces
- Fixed-parameter tractability results for feedback set problems in tournaments
- Convergence analysis of SP-iteration for \(G\)-nonexpansive mappings with directed graphs
- Maximum colored trees in edge-colored graphs
- Projective dimension and regularity of edge ideals of some weighted oriented graphs
- Chromatic polynomials of oriented graphs
- On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs
- On the \(k\)-domination number of digraphs
- A note on min-max pair in tournaments
- \((k-1)\)-kernels in strong \(k\)-transitive digraphs
- The complexity of automated addition of fault-tolerance without explicit legitimate states
- On a resource-constrained scheduling problem with application to distributed systems reconfiguration
- Paths and trails in edge-colored graphs
- The strong convexity spectra of grids
- On min-max pair in tournaments
- A calculus for measuring the elegance of abstract graphs
- On the complexity of the 3-kernel problem in some classes of digraphs
- Secure message transmission on directed networks
- Cycles in a tournament with pairwise zero, one or two given vertices in common
- Cycling in ecological networks: Finn's index revisited
- Phylogenetic networks from multi-labelled trees
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture
- Reachability problems in edge-colored digraphs
- A linear-time parameterized algorithm for computing the width of a DAG
- The Turán number of directed paths and oriented cycles
- Kernels by monochromatic paths and color-perfect digraphs
- Cycles and paths in edge‐colored graphs with given degrees
- Locally Semicomplete Digraphs and Generalizations
- Quasi-transitive digraphs and their extensions
- On Making Directed Graphs Transitive
- scientific article; zbMATH DE number 7225861 (Why is no real title available?)
- On G()-strictly pseudocontractive mapping in Hilbert spaces
- Convergence analysis of some faster iterative schemes for G-nonexpansive mappings in convex metric spaces endowed with a graph
- Two proofs of Bermond-Thomassen conjecture for regular tournaments
- On robust consensus of multi-agent systems with communication delays
- Fracture and fragmentation of simplicial finite element meshes using graphs
- Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two
- Approximation algorithms for orienting mixed graphs
- On the existence and number of (k+1)-kings in k-quasi-transitive digraphs
- Consensus of second-order multi-agent systems with disturbances generated by nonlinear exosystems under switching topologies
- Complementary cycles in regular bipartite tournaments
- Entropy and the complexity of graphs revisited
- Vertex-disjoint cycles in regular tournaments
- k-kernels in k-transitive and k-quasi-transitive digraphs
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
- Symbolic powers of monomial ideals and Cohen-Macaulay vertex-weighted digraphs
- Adaptive fault-tolerant attitude tracking control for spacecraft formation with unknown inertia
- Some remarks on the structure of strong k-transitive digraphs
- Three-dimensional circular formations via set stabilization
- Feedback vertex sets in tournaments
- Twin signed total Roman domatic numbers in digraphs
- A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS
- A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
- All feedback arc sets of a random Turán tournament have \(\lfloor{n}/{k}\rfloor-{k}+1\) disjoint \({k}\)-cliques (and this is tight)
- Congestion-free rerouting of flows on DAGs
- Extremal digraphs on Meyniel-type condition for Hamiltonian cycles in balanced bipartite digraphs
- Failed zero forcing and critical sets on directed graphs
- Center of Cartesian and strong product of digraphs
- Some results on 4-transitive digraphs
- Digraphs and variable degeneracy
- Local verification of global proofs
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- Vertices with the second neighborhood property in Eulerian digraphs
- Path-contractions, edge deletions and connectivity preservation
- Regularity and projective dimension of powers of edge ideal of the disjoint union of some weighted oriented gap-free bipartite graphs
- \(H\)-kernels by walks in subdivision digraph
- On the number of vertex-disjoint cycles in digraphs
- Transport on networks -- a playground of continuous and discrete mathematics in population dynamics
- Rainbow connectivity of cacti and of some infinite digraphs
- A flow formulation for horizontal coordinate assignment with prescribed width
- The minimum feedback arc set problem and the acyclic disconnection for graphs
- Assessing the computational complexity of multi-layer subgraph detection
- Edge ideals of oriented graphs
This page was built for publication: Digraphs. Theory, algorithms and applications.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539516)
