نتایج جستجو برای: monochromatic

تعداد نتایج: 5210  

Journal: :European heart journal cardiovascular Imaging 2015
Julia Stehli Tobias A Fuchs Adrian Singer Sacha Bull Olivier F Clerc Mathias Possner Oliver Gaemperli Ronny R Buechel Philipp A Kaufmann

AIMS Single-source, dual-energy coronary computed tomography angiography (CCTA) with monochromatic image reconstruction allows significant noise reduction. The aim of the study was to evaluate the impact of monochromatic CCTA image reconstruction on coronary stent imaging, as the latter is known to be affected by artefacts from highly attenuating strut material resulting in artificial luminal n...

Journal: :Discrete Mathematics 2011
Hortensia Galeana-Sánchez Mika Olsen

We call the digraph D an m-colored digraph if the arcs of D are colored with m colors. A subdigraph H of D is called monochromatic if all of its arcs are colored alike. A set N ⊆ V (D) is said to be a kernel by monochromatic paths if it satisfies the following two conditions: (i) for every pair of different vertices u, v ∈ N there is no monochromatic directed path between them and; (ii) for eve...

Journal: :Discrete Mathematics 1993

Journal: :Discrete Mathematics 2011

Journal: :Journal of Combinatorial Theory, Series A 1984

Journal: :Journal of High Energy Physics 2005

Journal: :Discrete Mathematics 2004
Hortensia Galeana-Sánchez Rocío Rojas-Monroy

We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed path (or a directed cycle) is called monochromatic if all of its arcs are coloured alike. A set N ⊆ V (D) is said to be a kernel by monochromatic paths if it satis5es the following two conditions: (i) For every pair of di7erent vertices u, v∈N , there is no monochromatic directed path between th...

Journal: :Discussiones Mathematicae Graph Theory 2009
Hortensia Galeana-Sánchez Rocío Rojas-Monroy B. Zavala

We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed path is called monochromatic if all of its arcs are coloured alike. A set N of vertices of D is called a kernel by monochromatic paths if for every pair of vertices of N there is no monochromatic path between them and for every vertex v / ∈ N there is a monochromatic path from v to N . We denote...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید