Sciweavers

206 search results - page 18 / 42
» New Data Structures for Subgraph Connectivity
Sort
View
NETWORKS
2011
13 years 2 months ago
On cut-based inequalities for capacitated network design polyhedra
In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
Christian Raack, Arie M. C. A. Koster, Sebastian O...
IV
2007
IEEE
184views Visualization» more  IV 2007»
14 years 1 months ago
Visual Data Mining of Web Navigational Data
Discovering web navigational trends and understanding data mining results is undeniably advantageous to web designers and web-based application builders. It is also desirable to i...
Jiyang Chen, Tong Zheng, William Thorne, Osmar R. ...
DM
2006
87views more  DM 2006»
13 years 7 months ago
A vertex incremental approach for maintaining chordality
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
Anne Berry, Pinar Heggernes, Yngve Villanger
VDA
2010
247views Visualization» more  VDA 2010»
13 years 10 months ago
Flow Web: a graph based user interface for 3D flow field exploration
While there have been intensive efforts in developing better 3D flow visualization techniques, little attention has been paid to the design of better user interfaces and more effe...
Lijie Xu, Han-Wei Shen
BMCBI
2006
142views more  BMCBI 2006»
13 years 7 months ago
Correlated fragile site expression allows the identification of candidate fragile genes involved in immunity and associated with
Background: Common fragile sites (cfs) are specific regions in the human genome that are particularly prone to genomic instability under conditions of replicative stress. Several ...
Angela Re, Davide Corà, Alda Maria Puliti, ...