Search results
From MaRDI portal
- forests with minimum number of Steiner points 2018-10-17 Paper Improved approximation algorithms for minimum cost node-connectivity augmentation problems 2018-06-01...10 bytes (16 words) - 05:56, 9 December 2023
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching 2000-10-18 Paper Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation 2000-10-17...10 bytes (16 words) - 05:56, 9 December 2023
- 2000-09-27 Paper A note on the vertex-connectivity augmentation problem 2000-07-19 Paper Successive edge-connectivity augmentation problems 2000-07-10 Paper Directed...10 bytes (16 words) - 05:56, 9 December 2023
- 2021-08-09 Paper The \((2, k)\)-connectivity augmentation problem: algorithmic aspects 2021-07-26 Paper Connectivity of orientations of 3-edge-connected graphs 2021-04-14...10 bytes (17 words) - 08:09, 9 December 2023
- 2022-10-07 Paper Component order connectivity in directed graphs 2022-08-18 Paper Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k...10 bytes (19 words) - 16:15, 10 December 2023
- https://portal.mardi4nfdi.de/entity/Q5368689 2017-10-10 Paper Compatible Connectivity-Augmentation of Planar Disconnected Graphs 2017-10-05 Paper Optimal detection...10 bytes (17 words) - 01:48, 11 December 2023
- location problem with local 3-vertex-connectivity requirements 2007-03-15 Paper Minimum augmentation of local edge-connectivity between vertices and vertex...10 bytes (16 words) - 03:26, 7 October 2023
- 2010-03-24 Paper Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs 2010-02-23 Paper Minimum degree orderings...10 bytes (17 words) - 21:59, 24 September 2023
- Parallel Algorithm for Finding a Minimum Spanning Forest 2003-01-05 Paper Quasi-fully dynamic algorithms for two-connectivity and cycle equivalence 2002-06-17...10 bytes (17 words) - 15:51, 10 December 2023
- Increasing Local Edge-Connectivity in Mixed Graphs 1996-04-08 Paper Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1...10 bytes (16 words) - 02:17, 10 December 2023
- \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem 2009-03-23 Paper Algorithmic Aspects of Graph Connectivity 2008-12-04...10 bytes (17 words) - 12:37, 8 December 2023
- eigenmatrices of nonnegative matrices 2011-09-01 Paper On algebraic connectivity augmentation 2011-07-13 Paper A Google-like model of road network dynamics and...10 bytes (18 words) - 13:01, 8 December 2023
- bounds for online weighted tree augmentation 2022-03-25 Paper Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems 2020-09-01...10 bytes (19 words) - 10:10, 11 December 2023
- (and spanning trees) in capacitated graphs 1999-09-15 Paper Edge-Connectivity Augmentation with Partition Constraints 1999-06-27 Paper https://portal.mardi4nfdi...10 bytes (18 words) - 15:05, 9 December 2023
- 2023-07-15 Paper On 3-degree 4-chordal graphs 2023-07-14 Paper Some results on connected vertex separators 2023-05-19 Paper P versus NPC: minimum Steiner trees...10 bytes (16 words) - 16:57, 6 October 2023
- Ski Rental 2012-09-12 Paper On the connectivity threshold for general uniform metric spaces 2012-01-18 Paper Connectivity guarantees for wireless networks...10 bytes (16 words) - 14:22, 11 December 2023
- of Publication Type Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\) 2018-11-19 Paper Pachinko...10 bytes (17 words) - 14:42, 8 December 2023
- mardi4nfdi.de/entity/Q4673413 2005-04-29 Paper NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization)...10 bytes (16 words) - 16:48, 6 October 2023
- III 2019-03-28 Paper Subquadratic Kernels for Implicit 3-H <scp>itting</scp> S <scp>et</scp> and 3-S <scp>et</scp> P <scp>acking</scp> Problems 2019-03-28...10 bytes (19 words) - 23:54, 9 December 2023
- for facial nonrepetitive colouring 2017-10-11 Paper Compatible Connectivity-Augmentation of Planar Disconnected Graphs 2017-10-05 Paper The number of lines...10 bytes (16 words) - 18:37, 11 December 2023
