Class information for: |
Basic class information |
Class id | #P | Avg. number of references |
Database coverage of references |
---|---|---|---|
27088 | 238 | 16.8 | 42% |
Hierarchy of classes |
The table includes all classes above and classes immediately below the current class. |
Cluster id | Level | Cluster label | #P |
---|---|---|---|
9 | 4 | COMPUTER SCIENCE, THEORY & METHODS//COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE//COMPUTER SCIENCE, INFORMATION SYSTEMS | 1247339 |
181 | 3 | DISCRETE MATHEMATICS//JOURNAL OF GRAPH THEORY//MATHEMATICS | 56539 |
303 | 2 | DISCRETE MATHEMATICS//JOURNAL OF GRAPH THEORY//JOURNAL OF COMBINATORIAL THEORY SERIES B | 18557 |
27088 | 1 | VERTEX RANKING//CONFLICT FREE COLORING//EDGE RANKING | 238 |
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 | VERTEX RANKING | authKW | 2483879 | 9% | 88% | 22 |
2 | CONFLICT FREE COLORING | authKW | 1824705 | 7% | 89% | 16 |
3 | EDGE RANKING | authKW | 1667897 | 5% | 100% | 13 |
4 | RANK NUMBER | authKW | 1026398 | 3% | 100% | 8 |
5 | TREE DEPTH | authKW | 742299 | 4% | 64% | 9 |
6 | ORDERED COLORING | authKW | 641499 | 2% | 100% | 5 |
7 | SEPARATOR TREE | authKW | 641499 | 2% | 100% | 5 |
8 | FACIAL WALK | authKW | 513199 | 2% | 100% | 4 |
9 | GEOMETRIC HYPERGRAPHS | authKW | 513199 | 2% | 100% | 4 |
10 | HOTLINK ASSIGNMENT | authKW | 513199 | 2% | 100% | 4 |
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 | 3707 | 34% | 0% | 82 |
2 | Mathematics | 2041 | 40% | 0% | 96 |
3 | Mathematics, Applied | 1456 | 32% | 0% | 75 |
4 | Computer Science, Information Systems | 857 | 16% | 0% | 38 |
5 | Computer Science, Software Engineering | 623 | 12% | 0% | 29 |
6 | Logic | 544 | 3% | 0% | 8 |
7 | Computer Science, Hardware & Architecture | 116 | 4% | 0% | 10 |
8 | Information Science & Library Science | 33 | 2% | 0% | 5 |
9 | Statistics & Probability | 16 | 3% | 0% | 6 |
10 | Computer Science, Artificial Intelligence | 13 | 3% | 0% | 6 |
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 | UMR 8557 | 225071 | 4% | 18% | 10 |
2 | PL MATH BUSINESS INFORMAT | 209546 | 3% | 23% | 7 |
3 | ANAL MATH SOCIALES | 166606 | 4% | 13% | 10 |
4 | IUUK | 164953 | 1% | 43% | 3 |
5 | DEP ALGORITHMS SYST MODELING | 128300 | 0% | 100% | 1 |
6 | EDUC MATH COMP | 128300 | 0% | 100% | 1 |
7 | MANAGEMENT INFORMAT SECT | 128300 | 0% | 100% | 1 |
8 | UNIV OCHHAUS | 128300 | 0% | 100% | 1 |
9 | UNIV TECH SOCIAL SCI | 128300 | 0% | 100% | 1 |
10 | INFORMAT PROC COMP SUPPORTED NEW MEDIA | 102637 | 1% | 40% | 2 |
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 | DISCUSSIONES MATHEMATICAE GRAPH THEORY | 9396 | 2% | 1% | 5 |
2 | DISCRETE & COMPUTATIONAL GEOMETRY | 8953 | 5% | 1% | 12 |
3 | DISCRETE APPLIED MATHEMATICS | 7847 | 8% | 0% | 20 |
4 | INFORMATION PROCESSING LETTERS | 7287 | 8% | 0% | 19 |
5 | ALGORITHMICA | 5600 | 4% | 0% | 10 |
6 | COMBINATORICS PROBABILITY & COMPUTING | 5064 | 3% | 1% | 6 |
7 | ACM TRANSACTIONS ON ALGORITHMS | 4722 | 2% | 1% | 4 |
8 | EUROPEAN JOURNAL OF COMBINATORICS | 4166 | 4% | 0% | 10 |
9 | SIAM JOURNAL ON DISCRETE MATHEMATICS | 4003 | 3% | 0% | 8 |
10 | DISCRETE MATHEMATICS | 3943 | 8% | 0% | 19 |
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 | VERTEX RANKING | 2483879 | 9% | 88% | 22 | Search VERTEX+RANKING | Search VERTEX+RANKING |
2 | CONFLICT FREE COLORING | 1824705 | 7% | 89% | 16 | Search CONFLICT+FREE+COLORING | Search CONFLICT+FREE+COLORING |
3 | EDGE RANKING | 1667897 | 5% | 100% | 13 | Search EDGE+RANKING | Search EDGE+RANKING |
4 | RANK NUMBER | 1026398 | 3% | 100% | 8 | Search RANK+NUMBER | Search RANK+NUMBER |
5 | TREE DEPTH | 742299 | 4% | 64% | 9 | Search TREE+DEPTH | Search TREE+DEPTH |
6 | ORDERED COLORING | 641499 | 2% | 100% | 5 | Search ORDERED+COLORING | Search ORDERED+COLORING |
7 | SEPARATOR TREE | 641499 | 2% | 100% | 5 | Search SEPARATOR+TREE | Search SEPARATOR+TREE |
8 | FACIAL WALK | 513199 | 2% | 100% | 4 | Search FACIAL+WALK | Search FACIAL+WALK |
9 | GEOMETRIC HYPERGRAPHS | 513199 | 2% | 100% | 4 | Search GEOMETRIC+HYPERGRAPHS | Search GEOMETRIC+HYPERGRAPHS |
10 | HOTLINK ASSIGNMENT | 513199 | 2% | 100% | 4 | Search HOTLINK+ASSIGNMENT | Search HOTLINK+ASSIGNMENT |
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 | CARDINAL, J , KNAUER, K , MICEK, P , UECKERDT, T , (2014) MAKING OCTANTS COLORFUL AND RELATED COVERING DECOMPOSITION PROBLEMS.SIAM JOURNAL ON DISCRETE MATHEMATICS. VOL. 28. ISSUE 4. P. 1948 -1959 | 18 | 90% | 2 |
2 | ALPERT, H , (2010) RANK NUMBERS OF GRID GRAPHS.DISCRETE MATHEMATICS. VOL. 310. ISSUE 23. P. 3324-3333 | 15 | 100% | 3 |
3 | MCDONALD, DC , (2015) ON-LINE VERTEX RANKING OF TREES.SIAM JOURNAL ON DISCRETE MATHEMATICS. VOL. 29. ISSUE 1. P. 145 -156 | 11 | 100% | 0 |
4 | KESZEGH, B , PALVOLGYI, D , (2014) OCTANTS ARE COVER-DECOMPOSABLE INTO MANY COVERINGS.COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS. VOL. 47. ISSUE 5. P. 585-588 | 10 | 100% | 3 |
5 | PACH, J , PALVOLGYI, D , (2016) UNSPLITTABLE COVERINGS IN THE PLANE.ADVANCES IN MATHEMATICS. VOL. 302. ISSUE . P. 433 -457 | 14 | 67% | 0 |
6 | MCDONALD, DC , (2016) LIST RANKINGS AND ON-LINE LIST RANKINGS OF GRAPHS.DISCRETE APPLIED MATHEMATICS. VOL. 205. ISSUE . P. 109 -125 | 11 | 85% | 0 |
7 | CICALESE, F , KESZEGH, B , LIDICKY, B , PALVOLGYI, D , VALLA, T , (2016) ON THE TREE SEARCH PROBLEM WITH NON-UNIFORM COSTS.THEORETICAL COMPUTER SCIENCE. VOL. 647. ISSUE . P. 22 -32 | 9 | 100% | 0 |
8 | HUNG, RW , (2008) OPTIMAL VERTEX RANKING OF BLOCK GRAPHS.INFORMATION AND COMPUTATION. VOL. 206. ISSUE 11. P. 1288-1302 | 13 | 81% | 3 |
9 | RICHTER, P , LEVEN, E , TRAN, A , EK, B , JACOB, J , NARAYAN, DA , (2014) RANK NUMBERS FOR BENT LADDERS.DISCUSSIONES MATHEMATICAE GRAPH THEORY. VOL. 34. ISSUE 2. P. 309 -329 | 9 | 100% | 1 |
10 | NAKAYAMA, S , MASUYAMA, S , (2006) A POLYNOMIAL TIME ALGORITHM FOR OBTAINING A MINIMUM VERTEX RANKING SPANNING TREE IN OUTERPLANAR GRAPHS.IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS. VOL. E89D. ISSUE 8. P. 2357-2363 | 12 | 92% | 0 |
Classes with closest relation at Level 1 |