5100 search results - page 403 / 1020 » The Linear Complexity of a Graph |
197
click to vote
GD
1995
Springer
15 years 11 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
239
click to vote
CIIA
2009
15 years 8 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
208
click to vote
ALGORITHMICA
2006
15 years 7 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
240
click to vote
ICIP
2010
IEEE
15 years 5 months ago
2010
IEEE
A novel multiregion graph cut image partitioning method combined with kernel mapping is presented. A kernel function transforms implicitly the image data into data of a higher dim...
218
click to vote
GBRPR
2009
Springer
15 years 5 months ago
2009
Springer
In this paper, we present a novel graph construction method and demonstrate its usage in a broad range of applications starting from a relatively simple single-surface segmentation...