6740 search results - page 335 / 1348 » An s -Hamiltonian Line Graph Problem |
177
click to vote
CPC
2011
14 years 11 months ago
2011
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
114
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
132
click to vote
IJAC
2007
15 years 4 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
135
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
168
click to vote
SIAMJO
2002
15 years 4 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...