Class information for: |
Basic class information |
Class id | #P | Avg. number of references |
Database coverage of references |
---|---|---|---|
25878 | 269 | 20.9 | 35% |
Hierarchy of classes |
The table includes all classes above and classes immediately below the current class. |
Terms with highest relevance score |
rank | Term | termType | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|---|
1 | DYNAMIC GRAPH ALGORITHMS | authKW | 710685 | 4% | 52% | 12 |
2 | DYNAMIC ALGORITHMS | authKW | 419767 | 5% | 26% | 14 |
3 | ASSOCIATIVE PARALLEL PROCESSOR | authKW | 340542 | 1% | 100% | 3 |
4 | ACCESS DATA BY CONTENTS | authKW | 227028 | 1% | 100% | 2 |
5 | DECREMENTAL ALGORITHMS | authKW | 227028 | 1% | 100% | 2 |
6 | DOMAIN DEPENDENT PLANNING | authKW | 227028 | 1% | 100% | 2 |
7 | EDGE AND VERTEX CONNECTIVITY | authKW | 227028 | 1% | 100% | 2 |
8 | SLIDING PUZZLE | authKW | 227028 | 1% | 100% | 2 |
9 | TOTAL ACQUISITION | authKW | 227028 | 1% | 100% | 2 |
10 | UNION FIND | authKW | 227020 | 2% | 33% | 6 |
Web of Science journal categories |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | Computer Science, Theory & Methods | 11614 | 57% | 0% | 153 |
2 | Computer Science, Software Engineering | 2212 | 21% | 0% | 57 |
3 | Computer Science, Information Systems | 2072 | 23% | 0% | 62 |
4 | Mathematics, Applied | 1535 | 30% | 0% | 82 |
5 | Logic | 1091 | 4% | 0% | 12 |
6 | Computer Science, Hardware & Architecture | 758 | 10% | 0% | 26 |
7 | Computer Science, Artificial Intelligence | 114 | 6% | 0% | 16 |
8 | Telecommunications | 57 | 4% | 0% | 12 |
9 | Operations Research & Management Science | 24 | 3% | 0% | 7 |
10 | Engineering, Electrical & Electronic | 10 | 6% | 0% | 17 |
Address terms |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | CHRC | 113514 | 0% | 100% | 1 |
2 | PARALLEL ALGORITHMS STRUCT | 113514 | 0% | 100% | 1 |
3 | UNITE RECHUR 11ES14 | 113514 | 0% | 100% | 1 |
4 | WIM | 113514 | 0% | 100% | 1 |
5 | DIPARTIMENTO INFORMAT SIST | 56756 | 0% | 50% | 1 |
6 | DIPARTIMENTO SISTEMI PROD | 56756 | 0% | 50% | 1 |
7 | DOMAIN SPECIF COMP | 56756 | 0% | 50% | 1 |
8 | UR PROSPECT GEOL BASE DONNEES | 56756 | 0% | 50% | 1 |
9 | COMP NETWORKING TECHNOL GRP | 56754 | 1% | 25% | 2 |
10 | DIPARTIMENTO MATEMAT PLICATA INFORMAT | 48644 | 1% | 14% | 3 |
Journals |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | ALGORITHMICA | 19849 | 7% | 1% | 20 |
2 | SIAM JOURNAL ON COMPUTING | 17340 | 8% | 1% | 21 |
3 | JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 13673 | 4% | 1% | 10 |
4 | INFORMATION PROCESSING LETTERS | 13034 | 10% | 0% | 27 |
5 | ACM TRANSACTIONS ON ALGORITHMS | 12802 | 3% | 2% | 7 |
6 | JOURNAL OF THE ACM | 6439 | 3% | 1% | 9 |
7 | LECTURE NOTES IN COMPUTER SCIENCE | 5559 | 25% | 0% | 66 |
8 | THEORETICAL COMPUTER SCIENCE | 3804 | 7% | 0% | 19 |
9 | JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2540 | 3% | 0% | 7 |
10 | INFORMATION AND COMPUTATION | 854 | 1% | 0% | 4 |
Author Key Words |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
LCSH search | Wikipedia search |
---|---|---|---|---|---|---|---|
1 | DYNAMIC GRAPH ALGORITHMS | 710685 | 4% | 52% | 12 | Search DYNAMIC+GRAPH+ALGORITHMS | Search DYNAMIC+GRAPH+ALGORITHMS |
2 | DYNAMIC ALGORITHMS | 419767 | 5% | 26% | 14 | Search DYNAMIC+ALGORITHMS | Search DYNAMIC+ALGORITHMS |
3 | ASSOCIATIVE PARALLEL PROCESSOR | 340542 | 1% | 100% | 3 | Search ASSOCIATIVE+PARALLEL+PROCESSOR | Search ASSOCIATIVE+PARALLEL+PROCESSOR |
4 | ACCESS DATA BY CONTENTS | 227028 | 1% | 100% | 2 | Search ACCESS+DATA+BY+CONTENTS | Search ACCESS+DATA+BY+CONTENTS |
5 | DECREMENTAL ALGORITHMS | 227028 | 1% | 100% | 2 | Search DECREMENTAL+ALGORITHMS | Search DECREMENTAL+ALGORITHMS |
6 | DOMAIN DEPENDENT PLANNING | 227028 | 1% | 100% | 2 | Search DOMAIN+DEPENDENT+PLANNING | Search DOMAIN+DEPENDENT+PLANNING |
7 | EDGE AND VERTEX CONNECTIVITY | 227028 | 1% | 100% | 2 | Search EDGE+AND+VERTEX+CONNECTIVITY | Search EDGE+AND+VERTEX+CONNECTIVITY |
8 | SLIDING PUZZLE | 227028 | 1% | 100% | 2 | Search SLIDING+PUZZLE | Search SLIDING+PUZZLE |
9 | TOTAL ACQUISITION | 227028 | 1% | 100% | 2 | Search TOTAL+ACQUISITION | Search TOTAL+ACQUISITION |
10 | UNION FIND | 227020 | 2% | 33% | 6 | Search UNION+FIND | Search UNION+FIND |
Core articles |
The table includes core articles in the class. The following variables is taken into account for the relevance score of an article in a cluster c: (1) Number of references referring to publications in the class. (2) Share of total number of active references referring to publications in the class. (3) Age of the article. New articles get higher score than old articles. (4) Citation rate, normalized to year. |
Rank | Reference | # ref. in cl. |
Shr. of ref. in cl. |
Citations |
---|---|---|---|---|
1 | ZAROLIAGIS, CD , (2002) IMPLEMENTATIONS AND EXPERIMENTAL STUDIES OF DYNAMIC GRAPH ALGORITHMS.EXPERIMENTAL ALGORITHMICS. VOL. 2547. ISSUE . P. 229 -278 | 24 | 77% | 8 |
2 | LA POUTRE, H , (2000) MAINTENANCE OF 2-AND 3-EDGE-CONNECTED COMPONENTS OF GRAPHS II.SIAM JOURNAL ON COMPUTING. VOL. 29. ISSUE 5. P. 1521 -1549 | 14 | 100% | 1 |
3 | BENDER, MA , FINEMAN, JT , GILBERT, S , TARJAN, RE , (2016) A NEW APPROACH TO INCREMENTAL CYCLE DETECTION AND RELATED PROBLEMS.ACM TRANSACTIONS ON ALGORITHMS. VOL. 12. ISSUE 2. P. - | 8 | 100% | 0 |
4 | GALIL, Z , ITALIANO, GF , SARNAK, N , (1999) FULLY DYNAMIC PLANARITY TESTING WITH APPLICATIONS.JOURNAL OF THE ACM. VOL. 46. ISSUE 1. P. 28 -91 | 19 | 66% | 3 |
5 | LA POUTRE, JA , WESTBROOK, J , (1998) DYNAMIC 2-CONNECTIVITY WITH BACKTRACKING.SIAM JOURNAL ON COMPUTING. VOL. 28. ISSUE 1. P. 10-26 | 16 | 80% | 0 |
6 | HOLM, J , DE LICHTENBERG, K , THORUP, M , (2001) POLY-LOGARITHMIC DETERMINISTIC FULLY-DYNAMIC ALGORITHMS FOR CONNECTIVITY, MINIMUM SPANNING TREE, 2-EDGE, AND BICONNECTIVITY.JOURNAL OF THE ACM. VOL. 48. ISSUE 4. P. 723 -760 | 13 | 72% | 120 |
7 | GELADE, W , MARQUARDT, M , SCHWENTICK, T , (2012) THE DYNAMIC COMPLEXITY OF FORMAL LANGUAGES.ACM TRANSACTIONS ON COMPUTATIONAL LOGIC. VOL. 13. ISSUE 3. P. - | 9 | 90% | 1 |
8 | HENZINGER, MR , KING, V , (1999) RANDOMIZED FULLY DYNAMIC GRAPH ALGORITHMS WITH POLYLOGARITHMIC TIME PER OPERATION.JOURNAL OF THE ACM. VOL. 46. ISSUE 4. P. 502 -516 | 12 | 80% | 66 |
9 | CATTANEO, G , FARUOLO, P , PETRILLO, UF , ITALIANO, GF , (2010) MAINTAINING DYNAMIC MINIMUM SPANNING TREES: AN EXPERIMENTAL STUDY.DISCRETE APPLIED MATHEMATICS. VOL. 158. ISSUE 5. P. 404 -425 | 12 | 63% | 4 |
10 | DONG, GZ , SU, JW , (2000) INCREMENTAL MAINTENANCE OF RECURSIVE VIEWS USING RELATIONAL CALCULUS/SQL.SIGMOD RECORD. VOL. 29. ISSUE 1. P. 44 -51 | 11 | 85% | 15 |
Classes with closest relation at Level 1 |