796 search results - page 90 / 160 » The Anonymous Subgraph Problem |
113
Voted
CIDM
2009
IEEE
15 years 4 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
101
Voted
WG
2004
Springer
15 years 6 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
123
Voted
NIPS
2004
15 years 2 months ago
2004
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
102
click to vote
ARSCOM
2007
15 years 28 days ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
122
Voted
NETWORKS
2010
14 years 11 months ago
2010
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...