3204 search results - page 171 / 641 » The b-chromatic Number of a Graph |
92
Voted
SAGA
2007
Springer
15 years 6 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 ...
105
Voted
SCAM
2006
IEEE
15 years 6 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...
119
Voted
WG
2004
Springer
15 years 6 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...
120
Voted
COCOON
2008
Springer
15 years 2 months 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...
103
Voted
IADIS
2008
15 years 2 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 ...