3204 search results - page 171 / 641 » The b-chromatic Number of a Graph |
SAGA
2007
Springer
14 years 4 months ago
2007
Springer
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
SCAM
2006
IEEE
14 years 4 months ago
2006
IEEE
Call graphs are widely used to represent calling relationships among methods. However, there is not much interest in calling relationships among library methods in many software e...
WG
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
COCOON
2008
Springer
14 years 4 days ago
2008
Springer
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node an...
IADIS
2008
13 years 11 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...