Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 conf/wg/BrandCGHK22
%A Brand, Cornelius
%A Ceylan, Esra
%A Ganian, Robert
%A Hatschka, Christian
%A Korchemna, Viktoriia
%B WG
%D 2022
%E Bekos, Michael A.
%E Kaufmann, Michael
%I Springer
%K dblp
%P 98-113
%T Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.
%U http://dblp.uni-trier.de/db/conf/wg/wg2022.html#BrandCGHK22
%V 13453
%@ 978-3-031-15914-5
@inproceedings{conf/wg/BrandCGHK22,
added-at = {2022-10-18T00:00:00.000+0200},
author = {Brand, Cornelius and Ceylan, Esra and Ganian, Robert and Hatschka, Christian and Korchemna, Viktoriia},
biburl = {https://www.bibsonomy.org/bibtex/28f56dfbf933be426743b1da6d4aa39e1/dblp},
booktitle = {WG},
crossref = {conf/wg/2022},
editor = {Bekos, Michael A. and Kaufmann, Michael},
ee = {https://doi.org/10.1007/978-3-031-15914-5_8},
interhash = {42cc806905f0bef7adc49fbffca43982},
intrahash = {8f56dfbf933be426743b1da6d4aa39e1},
isbn = {978-3-031-15914-5},
keywords = {dblp},
pages = {98-113},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2024-04-09T17:10:13.000+0200},
title = {Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.},
url = {http://dblp.uni-trier.de/db/conf/wg/wg2022.html#BrandCGHK22},
volume = 13453,
year = 2022
}