Pages that link to "Item:Q1252354"

The following pages link to Mengerian theorems for paths of bounded length (Q1252354):

Displaying 30 items.

• An extended network interdiction problem for optimal toll control (Q325471) (← links)
• The Menger number of the strong product of graphs (Q392649) (← links)
• Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
• Menger-type theorems with restrictions on path lengths (Q687118) (← links)
• High-dimensional structure estimation in Ising models: local separation criterion (Q693728) (← links)
• A variation of Menger's theorem for long paths (Q796549) (← links)
• A constraint programming approach to the additional relay placement problem in wireless sensor networks (Q903915) (← links)
• Bounded edge-connectivity and edge-persistence of Cartesian product of graphs (Q967381) (← links)
• Large fault-tolerant interconnection networks (Q1120553) (← links)
• Couplages et transversaux généralises d'un hypergraphe infini (Q1160144) (← links)
• Generalized degrees and Menger path systems (Q1199423) (← links)
• Vulnerability in graphs of diameter four (Q1310232) (← links)
• On line disjoint paths of bounded length (Q1837207) (← links)
• Counterexamples to theorems of Menger type for the diameter (Q1838498) (← links)
• The complexity of finding small separators in temporal graphs (Q2009634) (← links)
• Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
• On Saito's conjecture and the Oberly-Sumner conjectures (Q2409500) (← links)
• Short disjoint paths in locally connected graphs (Q2464055) (← links)
• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
• Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms (Q3656863) (← links)
• On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
• Connectivity properties of random subgraphs of the cube (Q4697813) (← links)
• The Complexity of Finding Small Separators in Temporal Graphs (Q5005147) (← links)
• On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
• Shortest edge-disjoint paths in graphs (Q5096182) (← links)
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
• The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
• Routing of electric vehicles: constrained shortest path problems with resource recovering nodes (Q5240194) (← links)
• Searching for a Visible, Lazy Fugitive (Q5302068) (← links)
• (Q6084397) (← links)