478 search results - page 82 / 96 » Measuring the Similarity of Labeled Graphs |
FOCS
1993
IEEE
14 years 1 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
This paper presents a complex systems overview of a power grid network under cascading conditions. The cascading effect has been simulated on three different networks, the IEEE 300...
ISCIS
2005
Springer
14 years 3 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
VLDB
2003
ACM
14 years 10 months ago
2003
ACM
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
CIARP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical...