Maximum rooted connected expansion
From MaRDI portal
Publication:2034397
DOI10.1016/J.TCS.2021.04.022zbMATH Open1506.68076OpenAlexW2887754464MaRDI QIDQ2034397FDOQ2034397
Authors: Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, V. Zissimopoulos 
Publication date: 22 June 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9607/
Recommendations
Cites Work
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Algorithmic graph theory and perfect graphs
- Isoperimetric numbers of graphs
- Expander graphs and their applications
- A General Approximation Technique for Constrained Forest Problems
- Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems
- The splittance of a graph
- Title not available (Why is that?)
- Graph classes with structured neighborhoods and algorithmic applications
- To satisfy impatient web surfers is hard
- Saving an epsilon: a 2-approximation for the \(k\)-MST problem in graphs
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Title not available (Why is that?)
- On an isoperimetric problem for Hamming graphs
- The vertex isoperimetric problem for the powers of the diamond graph
- Dominating cliques in chordal graphs
- Computing the isoperimetric number of a graph
- Connected surveillance game
Cited In (1)
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)
