[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 11638 (30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings) || Complexity of Fall Coloring for Restricted Graph Classes
- 作者Colbourn, Charles J.; Grossi, Roberto; Pisanti, Nadia
- 文件大小351.57KB
- 发表时间2019
- DOI10.1007/978-3-030-25005-8_29
- 页码352-364
[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 7643 ||Arumugam, S.; Smyth, W. F. · 2012
[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 6460 ||Iliopoulos, Costas S.; Smyth, William F. · 2011
[Lecture Notes in Computer Science] Combinatorial Optimization Volume 9849 ||Cerulli, Raffaele; Fujishige, Satoru; Mahjoub, A. Ridha · 2016
[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 10765 ||Brankovic, Ljiljana; Ryan, Joe; Smyth, William F. · 2018
[Lecture Notes in Computer Science] Combinatorial Image Analysis Volume 5852 || Signatures of Combinatorial MapsWiederhold, Petra; Barneva, Reneta P. · 2009
[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 1848 ||Giancarlo, Raffaele; Sankoff, David · 2000
[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 1645 ||Crochemore, Maxime; Paterson, Mike · 1999
[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 6661 ||Giancarlo, Raffaele; Manzini, Giovanni · 2011
[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 11638 (30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings) ||Colbourn, Charles J.; Grossi, Roberto; Pisanti, Nadia · 2019
[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 11638 (30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings) || Stable Noncrossing MatchingsColbourn, Charles J.; Grossi, Roberto; Pisanti, Nadia · 2019
[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 11638 (30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings) || Reaching 3-Connectivity via Edge-Edge AdditionsColbourn, Charles J.; Grossi, Roberto; Pisanti, Nadia · 2019
[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 11638 (30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings) || Complexity and Algorithms for Semipaired Domination in GraphsColbourn, Charles J.; Grossi, Roberto; Pisanti, Nadia · 2019
[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 11638 (30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings) || Complexity of Fall Coloring for Restricted Graph ClassesColbourn, Charles J.; Grossi, Roberto; Pisanti, Nadia · 2019
[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 11638 (30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings) || Computing the Rooted Triplet Distance Between Phylogenetic NetworksColbourn, Charles J.; Grossi, Roberto; Pisanti, Nadia · 2019
[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 11638 (30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings) || Fixed-Parameter Tractability of $$(n-k)$$ List ColoringColbourn, Charles J.; Grossi, Roberto; Pisanti, Nadia · 2019