Pages that link to "Item:Q1775893"
From MaRDI portal
The following pages link to Independence free graphs and vertex connectivity augmentation (Q1775893):
Displaying 23 items.
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- Connectivity augmentation in planar straight line graphs (Q661949) (← links)
- On triconnected and cubic plane graphs on given point sets (Q833718) (← links)
- Augmenting the connectivity of outerplanar graphs (Q848960) (← links)
- On shredders and vertex connectivity augmentation (Q924546) (← links)
- Augmenting the connectivity of geometric graphs (Q929747) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- Local edge-connectivity augmentation in hypergraphs is NP-complete (Q968204) (← links)
- An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees (Q1821118) (← links)
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects (Q2041970) (← links)
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\) (Q2115870) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
- Property testing on \(k\)-vertex-connectivity of graphs (Q2428696) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS (Q3166746) (← links)
- Structured Connectivity Augmentation (Q4555048) (← links)
- Structured Connectivity Augmentation (Q5111243) (← links)
- Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
