Sciweavers

1395 search results - page 36 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 7 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
137
Voted
DAM
2011
14 years 10 months ago
Untangling planar graphs from a specified vertex position - Hard cases
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
158
Voted
DM
2011
223views Education» more  DM 2011»
14 years 10 months ago
On graph equivalences preserved under extensions
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
Zbigniew Lonc, Miroslaw Truszczynski
170
Voted
DAM
2011
14 years 6 months ago
Triangular line graphs and word sense disambiguation
Linguists often represent the relationships between words in a collection of text as an undirected graph G = (V, E), were V is the vocabulary and vertices are adjacent in G if and...
Pranav Anand, Henry Escuadro, Ralucca Gera, Craig ...
134
Voted
CORR
2010
Springer
69views Education» more  CORR 2010»
14 years 10 months ago
Embedding a Forest in a Graph
For p 1, we prove that every forest with p trees whose sizes are a1, . . . , ap can be embedded in any graph containing at least p i=1(ai + 1) vertices and having minimum degree ...
Mark K. Goldberg, Malik Magdon-Ismail