Sciweavers

813 search results - page 8 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
TKDE
2012
250views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
EDBT
2008
ACM
160views Database» more  EDBT 2008»
13 years 9 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
DBA
2004
94views Database» more  DBA 2004»
13 years 9 months ago
Structural Knowledge Graph Navigator for the Icons Prototype
Structural Knowledge Graph Navigator (SKGN) supports end users of Web applications by simple means for ad hoc querying and browsing in an object-oriented database. The interface h...
Mariusz Trzaska, Kazimierz Subieta
HIPS
1998
IEEE
14 years 13 hour ago
A Graph-Based Framework for the Definition of Tools Dealing with Sparse and Irregular Distributed Data Structures
Industrial applications use specific problem-oriented implementations of large sparse and irregular data structures. Hence there is a need for tools that make it possible for deve...
Jean-Michel Lépine, Serge Chaumette, Frank ...
CIKM
2006
Springer
13 years 11 months ago
On the structural properties of massive telecom call graphs: findings and implications
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, D...