Sciweavers

44 search results - page 7 / 9
» Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenva...
Sort
View
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 11 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
EJC
2011
14 years 10 months ago
A Tutte-style proof of Brylawski's tensor product formula
We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...
Yuanan Diao, Gábor Hetyei, Kenneth Hinson
ICASSP
2011
IEEE
14 years 10 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus
EACL
1993
ACL Anthology
15 years 7 months ago
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Alain Lecomte
DIAGRAMS
2004
Springer
15 years 11 months ago
Drawing Graphs in Euler Diagrams
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...
Paul Mutton, Peter Rodgers, Jean Flower