Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs

Content
Grafik
Authors
  • Lucke, Felicia
  • Momeni, Ali
  • Paulusma, Daniël
  • Smith, Siani
Grafik Top
Shortfacts
Category
 Journal Paper
Divisions
 Theory and Applications of Algorithms
Subjects
 Theoretische Informatik
Journal or Publication Title
 Algorithmica
ISSN
 0178-4617
Publisher
 Springer Nature
Number
 7
Volume
 88
Date
 15 November 2025
Export
Grafik Top
Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
EPrints Logo
CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.