Sciweavers

3008 search results - page 188 / 602
» Independence in connected graphs
Sort
View
JGAA
2007
124views more  JGAA 2007»
15 years 6 months ago
Energy Models for Graph Clustering
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
Andreas Noack
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
15 years 4 months ago
DESSIN: Mining Dense Subgraph Patterns in a Single Graph
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
Shirong Li, Shijie Zhang, Jiong Yang
WG
2010
Springer
15 years 4 months ago
Graphs with Large Obstacle Numbers
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
Padmini Mukkamala, János Pach, Deniz Sari&o...
STOC
2003
ACM
137views Algorithms» more  STOC 2003»
16 years 6 months ago
Near-optimal network design with selfish agents
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
Elliot Anshelevich, Anirban Dasgupta, Éva T...
RR
2007
Springer
16 years 20 days ago
A Visualization Algorithm for Defeasible Logic Rule Bases over RDF Data
This work presents a visualization algorithm for defeasible logic rule bases as well as a software tool that applies this algorithm, according to which, a directed graph is produce...
Efstratios Kontopoulos, Nick Bassiliades, Grigoris...