356 search results - page 26 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
95
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
105
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
83
Voted
BIBE
2010
IEEE
15 years 1 months ago
2010
IEEE
This manuscript presents the most rigorous benchmarking of gene annotation algorithms for metagenomic datasets to date. We compare three different programs: GeneMark, MetaGeneAnnot...
119
click to vote
TOG
2008
15 years 8 days ago
2008
The goal of this paper is to investigate a new shape analysis method based on randomized cuts of 3D surface meshes. The general strategy is to generate a random set of mesh segmen...
103
click to vote
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...