Sciweavers

1201 search results - page 23 / 241
» Linear Probing and Graphs
Sort
View
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
15 years 8 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
DAM
2008
93views more  DAM 2008»
15 years 4 months ago
Planar graph bipartization in linear time
For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transv...
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian...
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 4 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
ICC
2007
IEEE
125views Communications» more  ICC 2007»
15 years 10 months ago
Scalable Fault Diagnosis in IP Networks using Graphical Models: A Variational Inference Approach
In this paper we investigate the fault diagnosis problem in IP networks. We provide a lower bound on the average number of probes per edge using variational inference technique pro...
Rajesh Narasimha, Souvik Dihidar, Chuanyi Ji, Stev...
TCBB
2008
113views more  TCBB 2008»
15 years 4 months ago
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
Alexander Schliep, Roland Krause