Sciweavers

813 search results - page 57 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
TVCG
2008
135views more  TVCG 2008»
13 years 9 months ago
Relation-Aware Volume Exploration Pipeline
Volume exploration is an important issue in scientific visualization. Research on volume exploration has been focused on revealing hidden structures in volumetric data. While the i...
Ming-Yuen Chan, Huamin Qu, Ka-Kei Chung, Wai-Ho Ma...
KAIS
2011
129views more  KAIS 2011»
13 years 4 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
GRID
2008
Springer
13 years 9 months ago
ADL: An Algorithm Definition Language for SmartGridSolve
SmartGridSolve is an extension of GridSolve that expands the single task map and client-server model of GridRPC by implementing server to server communication and the mapping of a...
Michele Guidolin, Alexey L. Lastovetsky
ICPR
2008
IEEE
14 years 3 months ago
Birkhoff polytopes, heat kernels and graph complexity
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
Francisco Escolano, Edwin R. Hancock, Miguel Angel...
VL
2003
IEEE
126views Visual Languages» more  VL 2003»
14 years 2 months ago
Spatial graph grammars for web information transformation
Thispaper presents an approach to spatial specifications for Web information transformation'. Extended from the Reserved Graph Grammar (RGG), a Spatial Graph Grammar (SGG) is...
Mei Kang Qiu, Guang-Lei Song, Jun Kong, Kang Zhang