Sciweavers

374 search results - page 21 / 75
» Stochastic Minority on Graphs
Sort
View
ICALP
2009
Springer
14 years 7 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
BIBE
2007
IEEE
141views Bioinformatics» more  BIBE 2007»
13 years 11 months ago
Graph and Topological Structure Mining on Scientific Articles
In this paper, we investigate a new approach for literature mining. We use frequent subgraph mining, and its generalization topological structure mining, for finding interesting re...
Fan Wang, Ruoming Jin, Gagan Agrawal, Helen Piontk...
DM
2008
81views more  DM 2008»
13 years 7 months ago
The diameter of protean graphs
Abstract. The web graph is a real-world self-organizing network whose vertices correspond to web pages, and whose edges correspond to links between pages. Many stochastic models fo...
Pawel Pralat
UML
2001
Springer
13 years 12 months ago
An Execution Algorithm for UML Activity Graphs
We present a real-time execution semantics for UML activity graphs that is intended for workflow modelling. The semantics is defined in terms of execution algorithms that define...
Rik Eshuis, Roel Wieringa
ESA
2005
Springer
93views Algorithms» more  ESA 2005»
14 years 28 days ago
New Tools and Simpler Algorithms for Branchwidth
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
Christophe Paul, Jan Arne Telle