The following pages link to Spectral Theory and Analysis (Q5747542):
Displaying 44 items.
- Dicycle cover of Hamiltonian oriented graphs (Q275871) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- Shattering, graph orientations, and connectivity (Q396883) (← links)
- An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← links)
- A sufficient condition for the existence of an anti-directed 2-factor in a directed graph (Q409370) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Derivation digraphs for dependencies in ordinal and similarity-based data (Q726160) (← links)
- Directed elimination games (Q896668) (← links)
- Finding even subgraphs even faster (Q1671994) (← links)
- Meta-modeling game for deriving theory-consistent, microstructure-based traction-separation laws via deep reinforcement learning (Q1986877) (← links)
- A non-cooperative meta-modeling game for automated third-party calibrating, validating and falsifying constitutive laws with parallelized adversarial attacks (Q2020834) (← links)
- Geometric deep learning for computational mechanics. I: Anisotropic hyperelasticity (Q2021107) (← links)
- Analyzing clustering and partitioning problems in selected VLSI models (Q2032285) (← links)
- Some constructions of quasi-strongly regular digraphs (Q2062901) (← links)
- Graphical structure of double controlled metric-like spaces with an application (Q2110462) (← links)
- Minimum arc-cuts of normally regular digraphs and Deza digraphs (Q2138973) (← links)
- Hamiltonian problems in directed graphs with simple row patterns (Q2143132) (← links)
- Some results on Berge's conjecture and begin-end conjecture (Q2145686) (← links)
- The 1-good neighbor connectivity of unidirectional star graph networks (Q2231739) (← links)
- Routing with congestion in acyclic digraphs (Q2274522) (← links)
- The order of hypotraceable oriented graphs (Q2275358) (← links)
- On the dual of the solvency cone (Q2345609) (← links)
- New spectral bounds on \(\mathcal{H}_2\)-norm of linear dynamical networks (Q2407204) (← links)
- A paradox of expert rights in abstract argumentation (Q2417385) (← links)
- Clustering without replication in combinatorial circuits (Q2424822) (← links)
- On the number of update digraphs and its relation with the feedback arc sets and tournaments (Q2446312) (← links)
- Hamiltonicity of large generalized de Bruijn cycles (Q2446865) (← links)
- The NL-flow polynomial (Q2664009) (← links)
- ON FREE SPECTRA OF LOCALLY TESTABLE SEMIGROUP VARIETIES (Q3094646) (← links)
- (Q3996383) (← links)
- (Q4539516) (← links)
- ON FREE SPECTRA OF VARIETIES OF LOCALLY THRESHOLD TESTABLE SEMIGROUPS (Q4649516) (← links)
- (Q4889873) (← links)
- Multi-level Access Control, Directed Graphs and Partial Orders in Flow Control for Data Secrecy and Privacy (Q5056067) (← links)
- (Q5090497) (← links)
- EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS (Q5411807) (← links)
- Cycle-connected mixed graphs and related problems (Q5918609) (← links)
- Supereulerian digraphs with given local structures (Q5964816) (← links)
- Locality and Centrality: The Variety ZG (Q6076180) (← links)
- Acyclic coloring of products of digraphs (Q6130210) (← links)
- A myopic adjustment process for mean field games with finite state and action space (Q6146790) (← links)
- Prefix graphs and their applications (Q6184370) (← links)
- Geometric and spectral analysis on weighted digraphs (Q6199678) (← links)
- Disk compression of \(k\)-mer sets (Q6487650) (← links)
