Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Soleimanfallah, A."'
The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if the given g
Externí odkaz:
http://arxiv.org/abs/1106.3527
Autor:
Balister, P., Gerke, S., Gutin, G., Johnstone, A., Reddington, J., Scott, E., Soleimanfallah, A., Yeo, A.
A set $X$ of vertices of an acyclic digraph $D$ is convex if $X\neq \emptyset$ and there is no directed path between vertices of $X$ which contains a vertex not in $X$. A set $X$ is connected if $X\neq \emptyset$ and the underlying undirected graph o
Externí odkaz:
http://arxiv.org/abs/0712.2661
Autor:
Balister, P., Gerke, S., Gutin, G., Johnstone, A., Reddington, J., Scott, E., Soleimanfallah, A., Yeo, A.
Publikováno v:
In Journal of Discrete Algorithms December 2009 7(4):509-518
Publikováno v:
Zahedan Journal of Research in Medical Sciences.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc880d74185908539f49f8c50efd60b4
https://doi.org/10.17795/zjrms-6664
https://doi.org/10.17795/zjrms-6664
Autor:
Soleimanfallah, Arezou, Yeo, Anders
Publikováno v:
Discrete Mathematics. 311(10-11):892-895
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=base_oa_____::0972cfdfc0abc47805a09fef265ae232
Autor:
Arezou Soleimanfallah, Paul Balister, Stefanie Gerke, Joseph Reddington, Elizabeth Scott, Adrian Johnstone, Anders Yeo, Gregory Gutin
Publikováno v:
Journal of Discrete Algorithms. 7:509-518
A set $X$ of vertices of an acyclic digraph $D$ is convex if $X\neq \emptyset$ and there is no directed path between vertices of $X$ which contains a vertex not in $X$. A set $X$ is connected if $X\neq \emptyset$ and the underlying undirected graph o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57d04f7c187bb3f711873f241335352e
https://doi.org/10.1016/j.jda.2008.07.008
https://doi.org/10.1016/j.jda.2008.07.008
Publikováno v:
Algorithmica
Algorithmica, Springer Verlag, 2012, 64, pp.112-125. ⟨10.1007/s00453-011-9548-8⟩
Algorithmica, Springer Verlag, 2012, 64, pp.112-125. ⟨10.1007/s00453-011-9548-8⟩
The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if the given g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::421c94c3e39b2208bbdaedad2652cc5d
http://arxiv.org/abs/1106.3527
http://arxiv.org/abs/1106.3527
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Parameterized & Exact Computation (9783642174926); 2010, p158-169, 12p