Record link: 
http://hdl.handle.net/20.500.12708/41671
-
Title: 
Maximal Independent Sets and Maximal Matchings in Series-parallel and Related Graph Classes
en
Citation: 
Drmota, M., Ramos, L., Requilé, C. L. M., & Rué, J. (2018). Maximal Independent Sets and Maximal Matchings in Series-parallel and Related Graph Classes. In J. A. Fill & M. D. Ward (Eds.), 29th International Conference on Probabilistic,  Combinatorial and Asymptotic Methods for the Analysis of Algorithms  (AofA 2018) (pp. 18:1-18:15). STACS 2016 - Leibniz International Proceedings in Informatics (LIPIcs). https://doi.org/10.4230/LIPIcs.AofA.2018.18
-
Publisher DOI: 
10.4230/LIPIcs.AofA.2018.18
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Language: 
English
-
Authors: 
Drmota, Michael 
Ramos, Lander 
Requilé, Clément Louis M. 
Rué, Juanjo 
-
Organisational Unit: 
E104-05 - Forschungsbereich Kombinatorik und Algorithmen 
-
Published in: 
29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018) 
-
ISBN: 
978-3-95977-078-1
-
Volume: 
110
-
Date (published): 
2018
-
Event name: 
AofA 2018 
-
Event date: 
25-Jun-2018 - 29-Jun-2018
-
Event place: 
Uppsala, Sweden
-
Number of Pages: 
15
-
Publisher: 
STACS 2016 - Leibniz International Proceedings in Informatics (LIPIcs)
-
Publisher: 
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl
-
Research Areas: 
außerhalb der gesamtuniversitären Forschungsschwerpunkte: 100%
-
Science Branch: 
Mathematik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

145
checked on Dec 1, 2023

Google ScholarTM

Check