Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Rosenke, Christian"'
Autor:
Le, Van Bang, Rosenke, Christian
A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T with leaf set V(G) such that, for all vertices x, y in V(G), the edge xy exists in G if and only if the distance between x and y in T is at most k. Such a tree T is called a k-l
Externí odkaz:
http://arxiv.org/abs/2308.10756
Autor:
Tredup, Ronny, Rosenke, Christian
Boolean nets are Petri nets that permit at most one token per place. Research has approached this important subject in many ways which resulted in various different classes of boolean nets. But yet, they are only distinguished by the allowed interact
Externí odkaz:
http://arxiv.org/abs/1806.03703
Autor:
Rosenke, Christian, Tredup, Ronny
Elementary net systems (ENS) are the most fundamental class of Petri nets. Their synthesis problem has important applications in the design of digital hardware and commercial processes. Given a labeled transition system (TS) $A$, feasibility is the N
Externí odkaz:
http://arxiv.org/abs/1711.00220
Autor:
Rosenke, Christian, Liśkiewicz, Maciej
Publikováno v:
In Information and Computation December 2020 275
Autor:
Rosenke, Christian, Tredup, Ronny
Publikováno v:
In Journal of Computer and System Sciences June 2020 110:37-54
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
Autor:
Rosenke, Christian
Publikováno v:
In Journal of Computer and System Sciences December 2016 82(8):1360-1387
Autor:
Nevries, Ragnar, Rosenke, Christian
Publikováno v:
In Discrete Applied Mathematics September 2014
Autor:
Nevries, Ragnar1, Rosenke, Christian1 christian.rosenke@uni-rostock.de
Publikováno v:
Graphs & Combinatorics. Sep2016, Vol. 32 Issue 5, p2053-2077. 25p.
Autor:
Lambusch, Fabienne, Waltemath, Dagmar, Wolkenhauer, Olaf, Sandkuhl, Kurt, Rosenke, Christian, Henkel, Ron
Publikováno v:
Database: The Journal of Biological Databases and Curation
Computational models in biology encode molecular and cell biological processes. These models often can be represented as biochemical reaction networks. Studying such networks, one is mostly interested in systems that share similar reactions and mecha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b199f51df23918d975ff3bafb162f105