6740 search results - page 330 / 1348 » An s -Hamiltonian Line Graph Problem |
124
click to vote
SIAMDM
2010
15 years 2 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
158
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
151
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
135
click to vote
BIRTHDAY
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...
121
click to vote
COMBINATORICS
1998
15 years 4 months ago
1998
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...