Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Nevries, Ragnar"'
Autor:
Nevries, Ragnar, Rosenke, Christian
The class ${\cal L}_k$ of $k$-leaf powers consists of graphs $G=(V,E)$ that have a $k$-leaf root, that is, a tree $T$ with leaf set $V$, where $xy \in E$, if and only if the $T$-distance between $x$ and $y$ is at most $k$. Structure and linear time r
Externí odkaz:
http://arxiv.org/abs/1402.1425
Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED)
Externí odkaz:
http://arxiv.org/abs/1304.6255
Autor:
Le, Van Bang, Nevries, Ragnar
Publikováno v:
In Theoretical Computer Science 3 April 2014 528:1-11
Autor:
Nevries, Ragnar, Rosenke, Christian
Publikováno v:
In Discrete Applied Mathematics September 2014
Publikováno v:
In Theoretical Computer Science 2009 410(51):5317-5333
Autor:
Nevries, Ragnar1, Rosenke, Christian1 christian.rosenke@uni-rostock.de
Publikováno v:
Graphs & Combinatorics. Sep2016, Vol. 32 Issue 5, p2053-2077. 25p.
Autor:
Nevries, Ragnar
The thesis considers the following graph problems: Efficient (Edge) Domination seeks for an independent vertex (edge) subset D such that all other vertices (edges) have exactly one neighbor in D. Polarity asks for a vertex subset that induces a compl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e089aa698a3d2ffff8a77ba02ad146b
Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72b1ea0b46b7ffdf5d86434ff06b7aa2
http://arxiv.org/abs/1304.6255
http://arxiv.org/abs/1304.6255
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.
Autor:
Nevries, Ragnar, Rosenke, Christian
Publikováno v:
Graph-Theoretic Concepts in Computer Science: 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers; 2013, p382-393, 12p