231 search results - page 24 / 47 » The Number of Independent Sets in a Regular Graph |
164
click to vote
CRYPTO
2012
Springer
13 years 8 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
204
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
171
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
146
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
155
click to vote
ICTAI
2002
IEEE
15 years 11 months ago
2002
IEEE
(Appears as a regular paper in the Proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Washington D.C, IEEE Computer Society, Nov. 2002, p...