18 search results - page 2 / 4 » Strongly adjacency-transitive graphs and uniquely shift-tran... |
DM
1998
13 years 5 months ago
1998
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
ACRI
2010
Springer
13 years 2 months ago
2010
Springer
This paper investigates the behaviors and the properties of a "Give and Take" cellular automaton on a graph. Using an economical metaphor, this model implements the excha...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
PAKDD
2007
ACM
13 years 11 months ago
2007
ACM
In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset co...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or th...