1149 search results - page 86 / 230 » Minimally non-Pfaffian graphs |
142
click to vote
DM
2008
15 years 6 months ago
2008
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
170
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
184
click to vote
ALENEX
2009
15 years 7 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
168
click to vote
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
196
click to vote
PAMI
2006
15 years 6 months ago
2006
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...