المؤلفون: Rolf Klein, Ansgar Grüne, Alexander Gilbers, Florian Berger

المصدر: Algorithms, Vol 2, Iss 3, Pp 1069-1086 (2009)

مصطلحات موضوعية: lion and man, safe path planning, avoidance number, pursuit games, graph separator, graph search, isoperimetric inequality, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95

وصف الملف: electronic resource

Relation: http://www.mdpi.com/1999-4893/2/3/1069/; https://doaj.org/toc/1999-4893

URL الوصول: https://doaj.org/article/f1e2ae90b163463f92d9eb3f169cb220

المؤلفون: Cordasco G., Gargano L., Rescigno A. A.

المساهمون: Guetl C., Ceravolo P., Jararweh Y., Benkhelifa E., Adedugbe O., Cordasco, G., Gargano, L., Rescigno, A. A.

مصطلحات موضوعية: Graph cut, Graph separator, Neighbourhood diversity and Clique-width, Parameterized Complexity, Treewidth

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-1-6654-9495-3; info:eu-repo/semantics/altIdentifier/wos/WOS:000813133100012; ispartofbook:2021 8th International Conference on Social Network Analysis, Management and Security, SNAMS 2021; 8th International Conference on Social Network Analysis, Management and Security, SNAMS 2021; firstpage:1; lastpage:8; numberofpages:8; http://hdl.handle.net/11591/468614; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85127425496

الاتاحة: http://hdl.handle.net/11591/468614
https://doi.org/10.1109/SNAMS53716.2021.9732127

المؤلفون: Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno

المساهمون: Guetl C., Ceravolo P., Jararweh Y., Benkhelifa E., Adedugbe O., Cordasco, G., Gargano, L., Rescigno, A. A.

المصدر: 2021 Eighth International Conference on Social Network Analysis, Management and Security (SNAMS).

مصطلحات موضوعية: Graph separator, Treewidth, Neighbourhood diversity and Clique-width, Graph cut, Parameterized Complexity

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a94289c1c06ca5767591c968200c287
https://doi.org/10.1109/snams53716.2021.9732127

المؤلفون: L. Aleksandrov, H. Djidjev

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.dcs.warwick.ac.uk/people/academic/Hristo.Djidjev/papers/genus-separator.ps.Z.

مصطلحات موضوعية: graph separator, graph genus, algorithm, divide-and-conquer, topological graph theory

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.9816; http://www.dcs.warwick.ac.uk/people/academic/Hristo.Djidjev/papers/genus-separator.ps.Z

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.9816
http://www.dcs.warwick.ac.uk/people/academic/Hristo.Djidjev/papers/genus-separator.ps.Z

المؤلفون: Jérôme Galtier

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.prism.uvsq.fr/rapports/1995/document_1995_36.ps.

مصطلحات موضوعية: Cutwidth, graph separator, partitioning, lower bounds, grid, nested loops, k-ary n-cube

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3633; http://www.prism.uvsq.fr/rapports/1995/document_1995_36.ps

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3633
http://www.prism.uvsq.fr/rapports/1995/document_1995_36.ps

المؤلفون: Hristo N. Djidjev, John R. Gilbert

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.dcs.warwick.ac.uk/~hristo/papers/multiple-weight.ps.gz.

مصطلحات موضوعية: graph separator, cutset, divide-and-conquer algorithm, separator theorem

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.7355; http://www.dcs.warwick.ac.uk/~hristo/papers/multiple-weight.ps.gz

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.7355
http://www.dcs.warwick.ac.uk/~hristo/papers/multiple-weight.ps.gz

المؤلفون: Hristo N. Djidjev, John R. Gilbert

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: ftp://parcftp.xerox.com/pub/gilbert/csl9207.ps.Z

مصطلحات موضوعية: graph separator, cutset, divide-and-conquer algorithm, separator

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.1113

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.1113

المؤلفون: Damaschke, Peter, 1963

المصدر: 4th International Workshop on Parameterized and Exact Computation IWPEC 2009, Lecture Notes in Computer Science. 5917:98-109

مصطلحات موضوعية: parameterized algorithm, clustering, vertex cover, graph separator, vertex degree

URL الوصول: https://research.chalmers.se/publication/106555

المؤلفون: Henning Fernau, Jochen Alber, Rolf Niedermeier

المصدر: Journal of Computer and System Sciences. 67:808-832

مصطلحات موضوعية: Discrete mathematics, Computer Networks and Communications, Applied Mathematics, Voltage graph, Strength of a graph, Butterfly graph, Divide-and-conquer algorithms, Theoretical Computer Science, law.invention, Planar graph, Parameterized complexity, Graph separator theorems, symbols.namesake, Computational Theory and Mathematics, law, Line graph, Fixed parameter tractability, Graph minor, symbols, Graph (abstract data type), Planar graph problems, Null graph, Algorithm, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7dc1e8d50d0b0e339fb601d280c331c1
https://doi.org/10.1016/s0022-0000(03)00072-2

المؤلفون: Mulzer, Wolfgang, Willert, Max

مصطلحات الفهرس: routing scheme, unit disk graph, separator, Data processing Computer science, InProceedings, publishedVersion