268 search results - page 30 / 54 » Cleaning Interval Graphs |
PARA
2004
Springer
15 years 3 months ago
2004
Springer
This paper gives a numerical algorithm able to compute the number of path-connected components of a set S defined by nonlinear inequalities. This algorithm uses interval analysis ...
68
Voted
BMVC
2000
14 years 11 months ago
2000
Long image sequences provide a wealth of information, which means that a compact representation is needed to efficiently process them. In this paper a novel representation for mot...
83
Voted
CPC
2004
14 years 10 months ago
2004
This note presents two results on real zeros of chromatic polynomials. The first result states that if G is a graph containing a q-tree as a spanning subgraph, then the chromatic ...
KDD
2001
ACM
15 years 10 months ago
2001
ACM
Web Usage Mining refers to the discovery of interesting information from user navigational behavior as stored in web access logs. While extracting simple information from web logs...
81
Voted
MFCS
2007
Springer
15 years 4 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...