Sciweavers

1648 search results - page 18 / 330
» On the generation of bicliques of a graph
Sort
View
EJC
2008
14 years 9 months ago
Fractional chromatic number of distance graphs generated by two-interval sets
Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z, D), has the set Z of all integers as the vertex Supported in part by the National Science ...
Daphne Der-Fen Liu, Xuding Zhu
INFOCOM
2009
IEEE
15 years 4 months ago
An Economically-Principled Generative Model of AS Graph Connectivity
We explore the problem of modeling Internet connectivity at the Autonomous System (AS) level and present an economically-principled dynamic model that reproduces key features of t...
Jacomo Corbo, Shaili Jain, Michael Mitzenmacher, D...
ICST
2009
IEEE
15 years 4 months ago
Optimizing Generation of Object Graphs in Java PathFinder
Java PathFinder (JPF) is a popular model checker for Java programs. JPF was used to generate object graphs as test inputs for object-oriented programs. Specifically, JPF was used...
Milos Gligoric, Tihomir Gvero, Steven Lauterburg, ...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
15 years 10 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
DNA
2004
Springer
15 years 3 months ago
Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
Ji Youn Lee, Hee-Woong Lim, Suk-In Yoo, Byoung-Tak...