5889 search results - page 280 / 1178 » Graph Layout Problems |
123
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
170
click to vote
DM
1998
15 years 6 months ago
1998
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
154
click to vote
SIAMDM
2010
15 years 5 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...
197
click to vote
CORR
2010
Springer
15 years 4 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 ...
194
Voted
WWW
2009
ACM
16 years 7 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 ...