Maximum rooted connected expansion
From MaRDI portal
Publication:2034397
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1323125 (Why is no real title available?)
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- Algorithmic graph theory and perfect graphs
- Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems
- Computing the isoperimetric number of a graph
- Connected surveillance game
- Dominating cliques in chordal graphs
- Expander graphs and their applications
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Graph classes with structured neighborhoods and algorithmic applications
- Isoperimetric numbers of graphs
- On an isoperimetric problem for Hamming graphs
- Saving an epsilon: a 2-approximation for the \(k\)-MST problem in graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The splittance of a graph
- The vertex isoperimetric problem for the powers of the diamond graph
- To satisfy impatient web surfers is hard
This page was built for publication: Maximum rooted connected expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2034397)