Zobrazeno 1 - 10
of 107
pro vyhledávání: '"Ton Kloks"'
Autor:
Ton Kloks, Mingyu Xiao
Publikováno v:
A Guide to Graph Algorithms ISBN: 9789811663499
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d81b57d0b034387cf6492b66dab11796
https://doi.org/10.1007/978-981-16-6350-5_3
https://doi.org/10.1007/978-981-16-6350-5_3
Autor:
Ton Kloks, Mingyu Xiao
Publikováno v:
A Guide to Graph Algorithms ISBN: 9789811663499
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::836be978535f310b1c079ca61e613fd1
https://doi.org/10.1007/978-981-16-6350-5_4
https://doi.org/10.1007/978-981-16-6350-5_4
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030950170
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::062e7f52281136dbac29cd96f23843a0
https://doi.org/10.1007/978-3-030-95018-7_6
https://doi.org/10.1007/978-3-030-95018-7_6
Autor:
Ton Kloks, Mingyu Xiao
Publikováno v:
A Guide to Graph Algorithms ISBN: 9789811663499
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e11d8ba3adf784648bcc27e77065b66
https://doi.org/10.1007/978-981-16-6350-5_1
https://doi.org/10.1007/978-981-16-6350-5_1
Autor:
Ton Kloks, Mingyu Xiao
Publikováno v:
A Guide to Graph Algorithms ISBN: 9789811663499
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::923dce584b9bb0076a1ce62f209bab1b
https://doi.org/10.1007/978-981-16-6350-5_2
https://doi.org/10.1007/978-981-16-6350-5_2
Autor:
Arti Pandey, Ton Kloks
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030678982
CALDAM
CALDAM
For a graph \(G=(V,E)\) with no isolated vertices, a set \(D\subseteq V\) is called a semitotal dominating set of G if (i) D is a dominating set of G, and (ii) every vertex in D has another vertex in D at a distance at most two. The minimum cardinali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32f6f6f2f998b9ba7d9cc6c234895c11
https://doi.org/10.1007/978-3-030-67899-9_5
https://doi.org/10.1007/978-3-030-67899-9_5
Autor:
Ton Kloks, Mingyu Xiao
This book A Guide to Graph Algorithms offers high-quality content in the research area of graph algorithms and explores the latest developments in graph algorithmics. The reader will gain a comprehensive understanding of how to use algorithms to expl
Autor:
Yue-Li Wang, Ton Kloks
Publikováno v:
Optimization Letters. 12:535-549
A retract of a graph G is an induced subgraph H of G such that there exists a homomorphism $$\rho :G \rightarrow H$$ . When both G and H are cographs, we show that the problem to determine whether H is a retract of G is NP-complete; moreover, we show
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20925abbc1c01a6276fff00110c15369
https://doi.org/10.1007/s11590-017-1126-9
https://doi.org/10.1007/s11590-017-1126-9
Publikováno v:
International Journal of Computer Mathematics. 94:922-932
An absorbant of a digraph D is a set such that, for every , there exists an arc with . An absorbant S is efficient if no two vertices in S have a common in-neighbour and the subdigraph induced by S has no arc. The efficient absorbant conjecture in ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fc7d9b580af3b11800f71844332d938
https://doi.org/10.1080/00207160.2016.1154949
https://doi.org/10.1080/00207160.2016.1154949