The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Paper info

Robert Endre Tarjan, Christopher J. Van Wyk
An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon. [Citation Graph (1, 0)][DBLP]
SIAM J. Comput., 1988, v:17, n:1, pp:143-178 [Journal]

Scores and Rank
SCEAS: 0.46967
SCEAS_PS: 0.01043
SCEAS_BPS: 0.02031
SCEAS_EPS: 0.02605
SCEAS_BEPS: 0.04960
SCEAS_B0: 3.16306
PAGE_RANK: 0.50634
HITS_H: 0
HITS_A: 0.08030
BHITS_H: 0
BHITS_A: 0.00348
SALSA_A: 0.16556
SALSA_H: 0
BSALSA_A: 0.04563
BSALSA_H: 0
P: 0.00000
BCC: 0.06365
citations_to_me: 1
citations_from_me: 0



Graph produced by graphviz-1.8.5
Level:
Show on graph: DBLP citations: Citations Imported from Citeseer:
Level:
Show on graph: DBLP citations: Citations Imported from Citeseer:

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002