scientific article; zbMATH DE number 3285076
From MaRDI portal
Publication:5567717
zbMath0178.27401MaRDI QIDQ5567717
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A graph-algorithmic approach for the study of metastability in Markov chains ⋮ Efficient algorithms for finding minimum spanning trees in undirected and directed graphs ⋮ The \(p\)-arborescence star problem: formulations and exact solution approaches ⋮ Compression of finite-state automata through failure transitions ⋮ Dispersal routes reconstruction and the minimum cost arborescence problem ⋮ Human mobility and time spent at destination: impact on spatial epidemic spreading ⋮ Exact arborescences, matchings and cycles ⋮ Approximations for constructing tree-form structures using specific material with fixed length ⋮ Generalized risk-dominance and asymmetric dynamics ⋮ Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids ⋮ Evolutionary game theory: a renaissance ⋮ Containment control of directed networks with time-varying nonlinear multi-agents using minimum number of leaders ⋮ Unnamed Item ⋮ Approximating the Spanning k-Tree Forest Problem ⋮ An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph ⋮ A simple algorithm and min-max formula for the inverse arborescence problem ⋮ On the complexity of some arborescences finding problems on a multishop radio network ⋮ A strongly polynomial algorithm for the inverse shortest arborescence problem ⋮ Minimax regret spanning arborescences under uncertain costs ⋮ Robustness of minimum cost arborescences ⋮ Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ Resolving Zeckhauser's paradox ⋮ The b‐bibranching problem: TDI system, packing, and discrete convexity ⋮ Branch‐and‐cut algorithms for the ‐arborescence star problem ⋮ Heuristic and exact algorithms for minimum-weight non-spanning arborescences ⋮ Learning extended tree augmented naive structures ⋮ The \(b\)-branching problem in digraphs ⋮ Precedence-constrained arborescences ⋮ Arborescence optimization problems solvable by Edmonds' algorithm ⋮ Algorithm for sequential construction of spanning minimal directed forests ⋮ An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading ⋮ A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem ⋮ Minimum incoming cost rules for arborescences ⋮ Reconfiguration of time-respecting arborescences ⋮ A distributed algorithm for directed minimum-weight spanning tree ⋮ Unnamed Item ⋮ Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems ⋮ Multi-dimensional classification with Bayesian networks ⋮ Unnamed Item ⋮ The ellipsoid method and its consequences in combinatorial optimization ⋮ The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? ⋮ Algorithmic Aspects of the Maximum Colorful Arborescence Problem ⋮ Inferring (biological) signal transduction networks via transitive reductions of directed graphs ⋮ Contrasting the Spread of Misinformation in Online Social Networks ⋮ Minimum cost arborescences ⋮ Approximation algorithms for metric tree cover and generalized tour and tree covers ⋮ On finding optimal polytrees ⋮ A dual ascent approach for steiner tree problems on a directed graph ⋮ An LP-based heuristic algorithm for the node capacitated in-tree packing problem ⋮ The weighted arborescence constraint ⋮ Worst-case performance of Wong's Steiner tree heuristic ⋮ Approximating optimum branchings in linear time ⋮ The Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifields ⋮ Counting minimum weight arborescences ⋮ Delay-constrained minimum shortest path trees and related problems ⋮ Delay-constrained minimum shortest path trees and related problems ⋮ Labeling schemes for tree representation ⋮ Inverse min-max spanning r-arborescence problem under the weighted sum-type Hamming distance ⋮ Optimal labellings of rooted directed trees ⋮ An efficient algorithm for minimum-weight bibranching ⋮ Rooted \(k\)-connections in digraphs ⋮ Distances in multimedia phylogeny ⋮ Minimum directed 1-subtree relaxation for score orienteering problem ⋮ Distributed block-diagonal approximation methods for regularized empirical risk minimization ⋮ Coordination problems on networks revisited: statics and dynamics ⋮ Approximating Minimum Representations of Key Horn Functions ⋮ Stochastic dynamics and Edmonds' algorithm ⋮ Estimating an oncogenetic tree when false negatives and positives are present ⋮ Approximate minimum directed spanning trees under congestion ⋮ A multiperiod min-sum arborescence problem
