1605 search results - page 154 / 321 » On Partitional Labelings of Graphs |
104
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
112
Voted
ENTCS
2008
15 years 2 months ago
2008
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...
100
Voted
IJCGA
2010
15 years 2 days ago
2010
A two-dimensional direction-length framework is a pair (G, p), where G = (V ; D, L) is a graph whose edges are labeled as `direction' or `length' edges, and a map p from...
117
click to vote
Publication
Recognizing multiple interleaved activities in a video requires implicitly partitioning the detections for each activity. Furthermore, constraints between activities are important ...
126
Voted
ICIP
2001
IEEE
16 years 4 months ago
2001
IEEE
3D-shape description requires the partition of objects in different parts. In this paper, we propose a new approach based on the analysis of a 3D skeleton. The skeleton is a repre...