243 search results - page 1 / 49 » On randomized representations of graphs using short labels |
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
ML
2010
ACM
13 years 3 months ago
2010
ACM
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
FAW
2008
Springer
13 years 6 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
ICML
2004
IEEE
14 years 5 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
ARSCOM
2004
13 years 4 months ago
2004
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...