Sciweavers

1883 search results - page 113 / 377
» Ordered theta graphs
Sort
View
DILS
2005
Springer
13 years 9 months ago
Assigning Unique Keys to Chemical Compounds for Data Integration: Some Interesting Counter Examples
Integrating data involving chemical structures is simplified when unique identifiers (UIDs) can be associated with chemical structures. For example, these identifiers can be use...
Greeshma Neglur, Robert L. Grossman, Bing Liu
CCCG
2008
13 years 9 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
UAI
2003
13 years 9 months ago
On Triangulating Dynamic Graphical Models
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
Jeff A. Bilmes, Chris Bartels
DM
2006
87views more  DM 2006»
13 years 8 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
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
13 years 5 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...