3105 search results - page 258 / 621 » The Path-Packing Structure of Graphs |
160
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
147
click to vote
DM
2006
15 years 4 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
156
Voted
IJCV
2006
15 years 4 months ago
2006
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
120
click to vote
JPDC
2008
15 years 4 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
136
click to vote
TDSC
2008
15 years 4 months ago
2008
The probabilistic packet marking (PPM) algorithm is a promising way to discover the Internet map or an attack graph that the attack packets traversed during a distributed denial-of...