1105 search results - page 57 / 221 » Linear choosability of graphs |
ICML
2010
IEEE
15 years 28 days ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
105
click to vote
IJFCS
2007
14 years 11 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
DSD
2010
IEEE
15 years 2 days ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
NN
2006
Springer
14 years 11 months ago
2006
Springer
- Contiguity Analysis is a straightforward generalization of Linear Discriminant Analysis in which the partition of elements is replaced by a more general graph structure. Applied ...
AMTA
2000
Springer
15 years 4 months ago
2000
Springer
This paper describes a language independent linearization engine, oxyGen. This system compiles target language grammars into programs that take feature graphs as inputs and genera...