Pages that link to "Item:Q1186784"
From MaRDI portal
The following pages link to Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784):
Displaying 34 items.
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks (Q273172) (← links)
- A rooted-forest partition with uniform vertex demand (Q695323) (← links)
- Source location with rigidity and tree packing requirements (Q867918) (← links)
- On \(k\)-planar crossing numbers (Q885282) (← links)
- Sparse hypergraphs and pebble game algorithms (Q1041613) (← links)
- Sparsity-certifying graph decompositions (Q1043807) (← links)
- A linear-time algorithm for finding a minimum spanning pseudoforest (Q1098629) (← links)
- Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases (Q1129014) (← links)
- The complexity of controlled selection (Q1173958) (← links)
- Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- An algorithm for two-dimensional rigidity percolation: The pebble game (Q1375495) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- An algorithm for packing connectors (Q1569028) (← links)
- Algorithmic problems in right-angled Artin groups: complexity and applications (Q1628497) (← links)
- Scheduling with interjob communication on parallel processors (Q1631686) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- Towards the linear arboricity conjecture (Q1985445) (← links)
- In search of the densest subgraph (Q2005555) (← links)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- On monoid graphs (Q2112028) (← links)
- Minimize the maximum duty in multi-interface networks (Q2429355) (← links)
- Single-pass streaming algorithms to partition graphs into few forests (Q2695324) (← links)
- Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries (Q2942621) (← links)
- Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- Trees, Paths, Stars, Caterpillars and Spiders (Q3467870) (← links)
- (Q5075827) (← links)
- Rigidity for sticky discs (Q5160632) (← links)
- Straight-line drawings of 1-planar graphs (Q6049552) (← links)
- Orientation‐based edge‐colorings and linear arboricity of multigraphs (Q6094040) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
