1952 search results - page 157 / 391 » Complete partitions of graphs |
142
Voted
CRYPTO
2012
Springer
13 years 7 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...
130
click to vote
DM
2008
15 years 4 months ago
2008
Let G be the set that contains precisely the graphs on n vertices with maximum degree 3 for which there exists a 4-cycle system of their complement in Kn. In this paper G is compl...
160
click to vote
SIMVIS
2004
15 years 6 months ago
2004
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
136
click to vote
GC
2010
Springer
15 years 2 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
138
click to vote
CICLING
2003
Springer
15 years 9 months ago
2003
Springer
This paper presents a graph-theoretical approach to lexical disambiguation on word co-occurrences. Producing a dictionary similar to WordNet, this method is the counterpart to word...