Sciweavers

2283 search results - page 214 / 457
» Bounds of Graph Characteristics
Sort
View
ISBI
2011
IEEE
13 years 1 days ago
Segmentation of anatomical branching structures based on texture features and graph cut
Segmentation of tree-like structure within medical imaging modalities, such as x-ray, MRI, ultrasound, etc., is an important step for analyzing branching patterns involved in many...
Tatyana Nuzhnaya, Erkang Cheng, Haibin Ling, Despi...
HICSS
2008
IEEE
90views Biometrics» more  HICSS 2008»
14 years 2 months ago
Power System Extreme Event Detection: The Vulnerability Frontier
In this work we apply graph theoretic tools to provide a close bound on a frontier relating the number of line outages in a grid to the power disrupted by the outages. This fronti...
Bernard C. Lesieutre, Ali Pinar, Sandip Roy
WADS
2007
Springer
114views Algorithms» more  WADS 2007»
14 years 2 months ago
Improved Algorithms for the Feedback Vertex Set Problems
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songji...
COCOON
2005
Springer
14 years 1 months ago
A Tight Analysis of the Maximal Matching Heuristic
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
Jean Cardinal, Martine Labbé, Stefan Langer...
APVIS
2008
13 years 9 months ago
Crossing Minimization meets Simultaneous Drawing
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
Markus Chimani, Michael Jünger, Michael Schul...