1105 search results - page 48 / 221 » Linear choosability of graphs |
IMA
2001
Springer
15 years 4 months ago
2001
Springer
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
ICML
2007
IEEE
16 years 20 days ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
WG
2001
Springer
15 years 4 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
100
click to vote
ESOP
2000
Springer
15 years 3 months ago
2000
Springer
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...
105
click to vote
SOCIALCOM
2010
14 years 9 months ago
2010
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...