Sciweavers

2487 search results - page 52 / 498
» Partitions of Graphs into Trees
Sort
View
DCC
2008
IEEE
14 years 8 months ago
An Approach to Graph and Netlist Compression
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...
Jeehong Yang, Serap A. Savari, Oskar Mencer
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 9 months ago
The Degree Distribution of Random k-Trees
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
Yong Gao
RSA
2006
98views more  RSA 2006»
13 years 9 months ago
Levels of a scale-free tree
Consider the random graph model of Barab
Zsolt Katona
IEICET
2011
13 years 4 months ago
Minimum Spanning Tree Problem with Label Selection
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
Akio Fujiyoshi, Masakazu Suzuki
NIPS
2008
13 years 10 months ago
Fast Prediction on a Tree
Given an n-vertex weighted tree with structural diameter S and a subset of m vertices, we present a technique to compute a corresponding m
Mark Herbster, Massimiliano Pontil, Sergio Rojas G...