90 search results - page 13 / 18 » Connecting face hitting sets in planar graphs |
104
Voted
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
118
click to vote
WEBI
2005
Springer
15 years 7 months ago
2005
Springer
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
109
click to vote
SIAMDM
2008
15 years 1 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
136
click to vote
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
148
click to vote
FOCS
1995
IEEE
15 years 5 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...