Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Nina Klobas"'
Publikováno v:
30th International Joint Conference on Artificial Intelligence (IJCAI-21), Montreal, Quebec, 21-26 Aug 2021 [Conference proceedings]
IJCAI
IJCAI
We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically increasing tim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f4bdf017bdb3377e41ee7c51cbd2fe9
https://doi.org/10.1007/s10458-022-09583-5
https://doi.org/10.1007/s10458-022-09583-5
Autor:
Matjaž Krnc, Nina Klobas
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030895426
COCOON
COCOON
Recognizing graphs with high level of symmetries is hard in general, and usually requires additional structural understanding. In this paper we study a particular graph parameter and motivate its usage by devising efficient recognition algorithms for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb14d01bd15263765d1dadb59a2ac335
https://doi.org/10.1007/978-3-030-89543-3_33
https://doi.org/10.1007/978-3-030-89543-3_33
Autor:
Nina Klobas, Matjaž Krnc
We identify all $[1, \lambda, 8]$-cycle regular $I$-graphs and all $[1, \lambda, 8]$-cycle regular double generalized Petersen graphs. As a consequence we describe linear recognition algorithms for these graph families. Using structural properties of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d7fff3fa9cb1016db48ab2e684b2f31
http://arxiv.org/abs/2008.08856
http://arxiv.org/abs/2008.08856