Digraphs. Theory, algorithms and applications
From MaRDI portal
Recommendations
Cited in
(53)- Finding even subgraphs even faster
- Meta-modeling game for deriving theory-consistent, microstructure-based traction-separation laws via deep reinforcement learning
- A non-cooperative meta-modeling game for automated third-party calibrating, validating and falsifying constitutive laws with parallelized adversarial attacks
- Geometric deep learning for computational mechanics. I: Anisotropic hyperelasticity
- Analyzing clustering and partitioning problems in selected VLSI models
- Some constructions of quasi-strongly regular digraphs
- Graphical structure of double controlled metric-like spaces with an application
- Minimum arc-cuts of normally regular digraphs and Deza digraphs
- Hamiltonian problems in directed graphs with simple row patterns
- Some results on Berge's conjecture and begin-end conjecture
- The 1-good neighbor connectivity of unidirectional star graph networks
- Routing with congestion in acyclic digraphs
- The order of hypotraceable oriented graphs
- On the dual of the solvency cone
- New spectral bounds on \(\mathcal{H}_2\)-norm of linear dynamical networks
- A paradox of expert rights in abstract argumentation
- Clustering without replication in combinatorial circuits
- On the number of update digraphs and its relation with the feedback arc sets and tournaments
- Hamiltonicity of large generalized de Bruijn cycles
- The NL-flow polynomial
- Dicycle cover of Hamiltonian oriented graphs
- On free spectra of locally testable semigroup varieties
- Solving min ones 2-SAT as fast as vertex cover
- Shattering, graph orientations, and connectivity
- scientific article; zbMATH DE number 46091 (Why is no real title available?)
- An ILP-refined tabu search for the directed profitable rural postman problem
- A sufficient condition for the existence of an anti-directed 2-factor in a directed graph
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- scientific article; zbMATH DE number 1764950 (Why is no real title available?)
- Graph Algorithms and Applications I
- Classes of directed graphs
- On free spectra of varieties of locally threshold testable semigroups.
- scientific article; zbMATH DE number 914491 (Why is no real title available?)
- Complexity-sensitive decision procedures for abstract argumentation
- Multi-level Access Control, Directed Graphs and Partial Orders in Flow Control for Data Secrecy and Privacy
- Algorithmic properties of sparse digraphs
- Eulerian and Hamiltonian dicycles in directed hypergraphs
- Digraphs
- Cycle-connected mixed graphs and related problems
- Supereulerian digraphs with given local structures
- Locality and Centrality: The Variety ZG
- Acyclic coloring of products of digraphs
- A myopic adjustment process for mean field games with finite state and action space
- Prefix graphs and their applications
- Geometric and spectral analysis on weighted digraphs
- Disk compression of k-mer sets
- Characterization of minimum restricted arc-cuts of unidirectional hypercubes
- Supereulerian oriented graphs with large arc-strong connectivity
- The oriented diameter of a bridgeless graph with the given path P_k
- Derivation digraphs for dependencies in ordinal and similarity-based data
- The 1-good-neighbor diagnosability of unidirectional hypercubes under the PMC model
- On the windy k-traveling salesman problem
- Directed elimination games
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 Q5747542)
