1199 search results - page 23 / 240 » Graph Theory |
107
click to vote
ICMS
2010
15 years 1 months ago
2010
This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This struct...
140
click to vote
SIAMDM
2008
15 years 2 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
115
click to vote
CORR
2004
Springer
15 years 2 months ago
2004
Springer
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
113
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
111
click to vote
ICDM
2009
IEEE
15 years 7 days ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...