Go to the corresponding LIPIcs Volume Portal 
Ducoffe, Guillaume ; Popa, Alexandru
pdfformat: 

@InProceedings{ducoffe_et_al:LIPIcs:2018:9954, author = {Guillaume Ducoffe and Alexandru Popa}, title = {{The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {6:16:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770941}, ISSN = {18688969}, year = {2018}, volume = {123}, editor = {WenLian Hsu and DerTsai Lee and ChungShou Liao}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9954}, URN = {urn:nbn:de:0030drops99549}, doi = {10.4230/LIPIcs.ISAAC.2018.6}, annote = {Keywords: maximum matching, FPT in P, modular decomposition, pruned graphs, onevertex extensions, P_4structure} }
Keywords:  maximum matching, FPT in P, modular decomposition, pruned graphs, onevertex extensions, P_4structure  
Seminar:  29th International Symposium on Algorithms and Computation (ISAAC 2018)  
Issue Date:  2018  
Date of publication:  27.11.2018 