Sciweavers

6598 search results - page 285 / 1320
» Graph Theory with Applications
Sort
View
JUCS
2007
117views more  JUCS 2007»
15 years 6 months ago
Connectivity and Reachability in Signed Networks
: For modeling real-life situations where not only the intensity of the relation existing between elements but also its polarity is important, we have proposed (see [Marcus and Tat...
Monica Tataram
JACM
2000
119views more  JACM 2000»
15 years 6 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
HICSS
2003
IEEE
104views Biometrics» more  HICSS 2003»
15 years 12 months ago
Information Technology Investment and Adoption: A Rational Expectations Perspective
This study examines the potential applications of the Rational Expectations Hypothesis (REH) in information technology (IT) investment and adoption decisionmaking. Although REH ha...
Yoris A. Au, Robert J. Kauffman
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
15 years 8 months ago
Metric forensics: a multi-level approach for mining volatile graphs
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...
ENTCS
2002
108views more  ENTCS 2002»
15 years 6 months ago
Rewriting in the partial algebra of typed terms modulo AC
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
Thomas Colcombet