Found 6 Documents (Results 1–6)
Cutting a tree with subgraph complementation is hard, except for some small trees. (English) Zbl 07719334
Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 3-19 (2022).
Incompressibility of \(H\)-free edge modification problems: towards a dichotomy. (English) Zbl 1533.68255
On subgraph complementation to \(H\)-free graphs. (English) Zbl 1541.68268
Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 118-129 (2021).
Filter Results by …
Document Type
- Journal Articles (4)
- Collection Articles (2)
all
top 5
Author
- Sandeep, R. B. (5)
- Antony, Dhanyamol (4)
- Pal, Sagartanu (4)
- Subashini, Ramasamy (4)
- Garchar, Jay (2)
- Sen, Sagnik (2)
- Cao, Yixin (1)
- Ke, Yuping (1)
- Marx, Dániel (1)
- Yuan, Hanchun (1)
Serial
- J. Comput. Syst. Sci. (1)
- J. Graph Theory (1)
- Theor. Comput. Sci. (1)
- Algorithmica (1)
