Sciweavers

95 search results - page 7 / 19
» Hamiltonian-Laceability of Star Graphs
Sort
View
TSP
2010
14 years 6 months ago
Learning Gaussian tree models: analysis of error exponents and extremal structures
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure a...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
15 years 9 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
ENDM
2008
88views more  ENDM 2008»
14 years 11 months ago
Stars and Bonds in Crossing-Critical Graphs
The structure of all known infinite families of crossing
Petr Hlinený, Gelasio Salazar
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 6 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
ECIR
2003
Springer
15 years 1 months ago
A Weighting Scheme for Star-Graphs
We present in this paper a relational approach for indexing and retrieving photographs from a collection. Instead of using simple keywords as an indexing language, we propose to u...
Jean Martinet, Iadh Ounis, Yves Chiaramella, Phili...