Graph covering using bounded size subgraphs
From MaRDI portal
Publication:6132557
Cites work
- scientific article; zbMATH DE number 1670653 (Why is no real title available?)
- scientific article; zbMATH DE number 1953187 (Why is no real title available?)
- scientific article; zbMATH DE number 1775412 (Why is no real title available?)
- scientific article; zbMATH DE number 2119674 (Why is no real title available?)
- A 2-approximation algorithm for the minimum weight edge dominating set problem
- Algorithms – ESA 2005
- Approximating the Minimum Tour Cover with a Compact Linear Program
- Approximating the tree and tour covers of a graph
- Automata, Languages and Programming
- Deterministic graph exploration with advice
- Edge exploration of a graph by mobile agent
- Edge exploration of anonymous graph by mobile agent with external help
- Exploring Unknown Undirected Graphs
- Generalized bounded tree cover of a graph
- How to trim a MST, a 2-approximation algorithm for minimum cost-tree cover
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Improved approximations for tour and tree covers
- Min-max tree covers of graphs.
- On approximability of the independent/connected edge dominating set problems
- Optimal constrained graph exploration
- Ramsey numbers and an approximation algorithm for the vertex cover problem
- The importance of being biased
- Tree exploration with little memory
This page was built for publication: Graph covering using bounded size subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132557)
