The Minimum Cost Connected Subgraph for the Vascular Network

Salman, Shatha A.; Abd-Almeer, Abeer Hussin

doi:10.1016/j.egypro.2018.11.172

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…may be a spanning sub graph of if includes all vertices of . In [14] gives the way of reaching the clotted in less time but in this paper the location of the clotted vessels is signed. A succession of vertices without repetition of order is called a path graph ( ), and size , the vertices are labeled and the edges are and if is closed is said to be a cycle graph ( ) of order and size , A graph is alleged to be connected graph if each combine of with size and no cycle is called a tree.…”

Section: Introductionmentioning

confidence: 99%

Clotting detection in the vascular network

Salman

Abd-Almeer

2020

IJEECS

View full text Add to dashboard Cite

<p>A lot of side effects accusers which the humans have suffered from a scan either by CT phrases, rays and magnetic resonance. Different methods were used to eliminate these affects depends on segmentation of vascular networks then represents it as a graph, where the intersection of the vessel as a vertex and the line between them as an edge. The place of the clot can be found by representing the weight of each edge as the amount of the blood in the vessel. Sign the place; if the amount is less than the normal flux that represents thrombosis. An algorithm in a graph theory is used to find the minimum distance, if more than one thrombosis exists to reach the nearest one and sign it alternately.</p>

show abstract

Section: Introductionmentioning

confidence: 99%