3105 search results - page 159 / 621 » The Path-Packing Structure of Graphs |
72
Voted
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another ...
137
Voted
AI
2003
Springer
15 years 8 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
135
Voted
PC
2010
15 years 1 months ago
2010
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
129
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
143
Voted
IWPC
2000
IEEE
15 years 8 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...