Sciweavers

677 search results - page 72 / 136
» Bipartite roots of graphs
Sort
View
NIPS
2008
14 years 13 days ago
Online Prediction on Large Diameter Graphs
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
Mark Herbster, Guy Lever, Massimiliano Pontil
COLOGNETWENTE
2009
14 years 3 days ago
Colored Trees in Edge-Colored Graphs
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
A. Abouelaoualim, V. Borozan, Yannis Manoussakis, ...
DCC
2008
IEEE
14 years 10 months ago
Edge local complementation and equivalence of binary linear codes
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
Lars Eirik Danielsen, Matthew G. Parker
PKDD
2009
Springer
129views Data Mining» more  PKDD 2009»
14 years 5 months ago
RTG: A Recursive Realistic Graph Generator Using Random Typing
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...
Leman Akoglu, Christos Faloutsos
ICMCS
2008
IEEE
120views Multimedia» more  ICMCS 2008»
14 years 5 months ago
Using Semantic Graphs for Image Search
In this paper, we propose a Semantic Graphs for Image Search (SGIS) system, which provides a novel way for image search by utilizing collaborative knowledge in Wikipedia and netwo...
Jyh-Ren Shieh, Yang-Ting Yeh, Chih-Hung Lin, Ching...