Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Irene Heinrich"'
Autor:
Irene Heinrich, Manuel Streicher
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 7, Iss 2, Pp 411-428 (2019)
Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an Eulerian graph decomposes into a unique number of cycles if and only if it does not contain two edge disjoint
Externí odkaz:
https://doaj.org/article/a1f261d1b2d9485d9fb53e82f7bec20a
Autor:
Peter Tittmann, Irene Heinrich
Publikováno v:
Graphs and Combinatorics. 34:1203-1216
The neighborhood complex of a graph is the family of subsets of open neighborhoods of its vertices. The neighborhood polynomial is the ordinary generating function for the number of sets of the neighborhood complex with respect to their cardinality.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3fa7d61a8adae841f0073aa0d3a064f4
https://doi.org/10.1007/s00373-018-1968-7
https://doi.org/10.1007/s00373-018-1968-7
Publikováno v:
Discrete Mathematics. 341:119-125
A prominent parameter in the context of network analysis, originally proposed by Watts and Strogatz (1998), is the clustering coefficient of a graph G . It is defined as the arithmetic mean of the clustering coefficients of its vertices, where the cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26ba2ba8cf9d335183df8ad47f24ad0e
https://doi.org/10.1016/j.disc.2017.08.020
https://doi.org/10.1016/j.disc.2017.08.020
Haj\'os conjecture asserts that a simple Eulerian graph on n vertices can be decomposed into at most (n - 1)/2 cycles. The conjecture is only proved for graph classes in which every element contains vertices of degree 2 or 4. We develop new technique
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2e3f1c0f18779779128e46724dc2bfc
Autor:
Marie Irene Heinrich
Publikováno v:
SSRN Electronic Journal.
Reza Vali, a Persian composer of Contemporary Iranian Art Music, has composed numerous works for Western instruments that derive influence from Iranian music. This article examines the use of the Persian dastgāh and maqām in Reza Vali’s compositi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aef6f124529023c6869c5ee7ad875e21
https://doi.org/10.2139/ssrn.3280534
https://doi.org/10.2139/ssrn.3280534
Autor:
Marco V. Natale, Sven O. Krumke, Christian Weis, Deepak M. Mathew, Norbert Wehn, Irene Heinrich, Matthias Jung
Publikováno v:
MEMSYS
The increasing gap between the bandwidth requirements of modern Systems on Chip (SoC) and the I/O data rate delivered by Dynamic Random Access Memory (DRAM), known as the Memory Wall, limits the performance of today's data-intensive applications. Gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2fa074715e6d23b435b6dd0c71f73ddb
https://doi.org/10.1145/2989081.2989131
https://doi.org/10.1145/2989081.2989131
Publikováno v:
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Graph-Theoretic Concepts in Computer Science
Graph-Theoretic Concepts in Computer Science ISBN: 9783030604394
WG
Graph-Theoretic Concepts in Computer Science-46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers
Lecture Notes in Computer Science-Graph-Theoretic Concepts in Computer Science
Graph-Theoretic Concepts in Computer Science ISBN: 9783030604394
WG
Graph-Theoretic Concepts in Computer Science-46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers
If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a canonical decomposition into 2.5-connected components. These component
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8803d2a4929f64401e4f0df697b5c45