Go to the corresponding LIPIcs Volume Portal 
Duarte, Gabriel L. ; Lokshtanov, Daniel ; Pedrosa, Lehilton L. C. ; Schouery, Rafael C. S. ; Souza, UĂ©verton S.
pdfformat: 

@InProceedings{duarte_et_al:LIPIcs:2019:11473, author = {Gabriel L. Duarte and Daniel Lokshtanov and Lehilton L. C. Pedrosa and Rafael C. S. Schouery and U{\'e}verton S. Souza}, title = {{Computing the Largest Bond of a Graph}}, booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)}, pages = {12:112:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771290}, ISSN = {18688969}, year = {2019}, volume = {148}, editor = {Bart M. P. Jansen and Jan Arne Telle}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2019/11473}, URN = {urn:nbn:de:0030drops114732}, doi = {10.4230/LIPIcs.IPEC.2019.12}, annote = {Keywords: bond, cut, maximum cut, connected cut, FPT, treewidth, cliquewidth} }
Keywords:  bond, cut, maximum cut, connected cut, FPT, treewidth, cliquewidth  
Collection:  14th International Symposium on Parameterized and Exact Computation (IPEC 2019)  
Issue Date:  2019  
Date of publication:  04.12.2019 