796 search results - page 74 / 160 » The Anonymous Subgraph Problem |
96
Voted
IWOCA
2009
Springer
15 years 7 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
114
click to vote
FSTTCS
2007
Springer
15 years 7 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
116
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
109
click to vote
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
97
Voted
AAAI
2011
14 years 23 days ago
2011
The conservation of wildlife corridors between existing habitat preserves is important for combating the effects of habitat loss and fragmentation facing species of concern. We in...