Sciweavers

47 search results - page 5 / 10
» Independence number and clique minors
Sort
View
ECOOP
1993
Springer
13 years 11 months ago
Integrating Independently-Developed Components in Object-Oriented Languages
Object-oriented programming promises to increase programmer productivity through better reuse of existing code. However, reuse is not yet pervasive in today’s object-oriented pro...
Urs Hölzle
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
13 years 11 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
MICS
2010
134views more  MICS 2010»
13 years 5 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
COMBINATORICA
2007
92views more  COMBINATORICA 2007»
13 years 7 months ago
Codes And Xor Graph Products
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3...
Noga Alon, Eyal Lubetzky
JGT
2006
98views more  JGT 2006»
13 years 7 months ago
Group chromatic number of planar graphs of girth at least 4
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
Hong-Jian Lai, Xiangwen Li