4913 search results - page 240 / 983 » Results and Perspectives of the G |
180
click to vote
SIAMDM
2010
15 years 5 months ago
2010
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...
162
click to vote
SIAMDM
2010
15 years 5 months ago
2010
Let g1, . . . , gk be tropical polynomials in n variables with Newton polytopes P1, . . . , Pk. We study combinatorial questions on the intersection of the tropical hypersurfaces d...
204
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
166
click to vote
IFIP12
2009
15 years 4 months ago
2009
In this paper we present a hybrid filtering algorithm that attempts to deal with low prediction Coverage, a problem especially present in sparse datasets. We focus on Item HyCoV, a...
185
click to vote
CPC
2010
15 years 4 months ago
2010
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...