216 search results - page 22 / 44 » Exact Algorithms for L (2, 1)-Labeling of Graphs |
138
click to vote
SIGCSE
1997
ACM
15 years 10 months ago
1997
ACM
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
143
click to vote
IJCV
2006
15 years 5 months ago
2006
This paper explores various aspects of the image decomposition problem using modern variational techniques. We aim at splitting an original image f into two components u and v, whe...
147
click to vote
DILS
2005
Springer
15 years 7 months ago
2005
Springer
Integrating data involving chemical structures is simplified when unique identifiers (UIDs) can be associated with chemical structures. For example, these identifiers can be use...
134
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
145
Voted
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
Real-time streaming signal processing systems typically desire high throughput and low latency. Many such systems can be modeled as synchronous data flow graphs. In this paper, w...