Sciweavers

6413 search results - page 26 / 1283
» Classes of cycle bases
Sort
View
85
Voted
ENDM
2007
73views more  ENDM 2007»
15 years 12 days ago
Two New Classes of Hamiltonian Graphs: (Extended Abstract)
d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook Univ...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
FDL
2007
IEEE
15 years 6 months ago
Modelling Alternatives for Cycle Approximate Bus TLMs
Transaction level models (TLMs) can be constructed at t levels of abstraction, denoted as untimed (UT), cycle-approximate (CX), and cycle accurate (CA) in this paper. The choice o...
Martin Radetzki, Rauf Salimi Khaligh
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
15 years 4 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
95
Voted
KDD
2009
ACM
141views Data Mining» more  KDD 2009»
16 years 1 months ago
Meme-tracking and the dynamics of the news cycle
Tracking new topics, ideas, and "memes" across the Web has been an issue of considerable interest. Recent work has developed methods for tracking topic shifts over long ...
Jure Leskovec, Lars Backstrom, Jon M. Kleinberg
98
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
Minimum cuts and shortest homologous cycles
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri