Sciweavers

1664 search results - page 31 / 333
» Distance labeling in graphs
Sort
View
JCB
2006
124views more  JCB 2006»
14 years 11 months ago
The Distribution of Genomic Distance between Random Genomes
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
David Sankoff, Lani Haque
WG
2007
Springer
15 years 6 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
DM
2008
72views more  DM 2008»
14 years 12 months ago
(p, 1)-Total labelling of graphs
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
Frédéric Havet, Min-Li Yu
ICML
2003
IEEE
16 years 19 days ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
ISNN
2007
Springer
15 years 6 months ago
Discriminant Analysis with Label Constrained Graph Partition
In this paper, a space partition method called “Label Constrained Graph Partition” (LCGP) is presented to solve the Sample-InterweavingPhenomenon in the original space. We firs...
Peng Guan, Yaoliang Yu, Liming Zhang