Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Mathematics of computing → Graph enumeration"'
Publikováno v:
ESA 2021-29th Annual European Symposium on Algorithms
ESA 2021-29th Annual European Symposium on Algorithms, Sep 2021, Virtual, Portugal. pp.1-14, ⟨10.4230/LIPIcs.ESA.2021.80⟩
ESA 2021-29th Annual European Symposium on Algorithms, Sep 2021, Virtual, Portugal. pp.1-14, ⟨10.4230/LIPIcs.ESA.2021.80⟩
When a problem has more than one solution, it is often important, depending on the underlying context, to enumerate (i.e., to list) them all. Even when the enumeration can be done in polynomial delay, that is, spending no more than polynomial time to
Autor:
Sadakane, Kunihiko
We consider the problem of finding succinct representations of graphs, that is, encodings using asymptotically the minimum number of bits which support queries on the graphs efficiently. For a special class of graphs, there exist many theoretical res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ecfd33e5efe8f70608459e0bcf2e086
Publikováno v:
WABI 2021-21st International Workshop on Algorithms in Bioinformatics
WABI 2021-21st International Workshop on Algorithms in Bioinformatics, Aug 2021, Chicago, United States. pp.1-18, ⟨10.4230/LIPIcs.WABI.2021.3⟩
WABI 2021-21st International Workshop on Algorithms in Bioinformatics, Aug 2021, Chicago, United States. pp.1-18, ⟨10.4230/LIPIcs.WABI.2021.3⟩
Cophylogeny reconciliation is a powerful method for analyzing host-parasite (or host-symbiont) co-evolution. It models co-evolution as an optimization problem where the set of all optimal solutions may represent different biological scenarios which t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b42c956454615f45c8a795d2223cea2
http://hdl.handle.net/11385/210657
http://hdl.handle.net/11385/210657
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 204, 29th Annual European Symposium on Algorithms (ESA 2021), pages 0:i-0:xx
LIPIcs, Vol. 204, 29th Annual European Symposium on Algorithms (ESA 2021), pages 0:i-0:xx
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::680fffb25a506337a0daa8b00debae2e
LIPIcs, Volume 204, ESA 2021, Complete Volume
LIPIcs, Vol. 204, 29th Annual European Symposium on Algorithms (ESA 2021), pages 1-1340
LIPIcs, Vol. 204, 29th Annual European Symposium on Algorithms (ESA 2021), pages 1-1340
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a473de808f7f82a1dee1c640d7ddabfd