Sciweavers

20 search results - page 3 / 4
» Total and fractional total colourings of circulant graphs
Sort
View
SPAA
1990
ACM
13 years 9 months ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter
FCT
2009
Springer
13 years 12 months ago
On Random Betweenness Constraints
Despite of their applicability betweennness constraints have (to the authorā€™s knowledge) hardly been considered from the random structures point of view. They are essentially diļ...
Andreas Goerdt
WG
2010
Springer
13 years 3 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
ICML
2006
IEEE
14 years 6 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 5 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata