Class information for: |
Basic class information |
Class id | #P | Avg. number of references |
Database coverage of references |
---|---|---|---|
20526 | 456 | 15.8 | 34% |
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 |
3048 | 2 | SEARCH GAME//COPS AND ROBBERS//PURSUIT EVASION | 2456 |
20526 | 1 | ART GALLERY PROBLEM//ART GALLERY//ORTHOGONAL POLYGONS | 456 |
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 | ART GALLERY PROBLEM | authKW | 1418868 | 6% | 76% | 28 |
2 | ART GALLERY | authKW | 1101997 | 5% | 69% | 24 |
3 | ORTHOGONAL POLYGONS | authKW | 524974 | 3% | 56% | 14 |
4 | ART GALLERY THEOREMS | authKW | 451993 | 2% | 75% | 9 |
5 | STAIRCASE PATHS | authKW | 267850 | 1% | 100% | 4 |
6 | VERTEX GUARDS | authKW | 267850 | 1% | 100% | 4 |
7 | TERRAIN GUARDING | authKW | 214278 | 1% | 80% | 4 |
8 | WATCHMAN ROUTE | authKW | 214278 | 1% | 80% | 4 |
9 | WATCHMAN ROUTE PROBLEM | authKW | 214278 | 1% | 80% | 4 |
10 | 15D TERRAIN | authKW | 200888 | 1% | 100% | 3 |
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 | Mathematics | 5205 | 46% | 0% | 211 |
2 | Computer Science, Theory & Methods | 5050 | 29% | 0% | 133 |
3 | Mathematics, Applied | 3269 | 34% | 0% | 155 |
4 | Computer Science, Information Systems | 745 | 11% | 0% | 50 |
5 | Computer Science, Software Engineering | 663 | 9% | 0% | 42 |
6 | Computer Science, Artificial Intelligence | 192 | 6% | 0% | 27 |
7 | Robotics | 153 | 2% | 0% | 8 |
8 | Logic | 153 | 1% | 0% | 6 |
9 | Computer Science, Hardware & Architecture | 130 | 3% | 0% | 15 |
10 | Computer Science, Interdisciplinary Applications | 51 | 4% | 0% | 16 |
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 | BRONFMAN SCI COMP SCI | 66963 | 0% | 100% | 1 |
2 | INTELLIGENT SYST INFRASTRUCT GRP | 66963 | 0% | 100% | 1 |
3 | POS O CIENCIA INGN COMPUTAC | 66963 | 0% | 100% | 1 |
4 | TECHNOL MANATEMENT | 66963 | 0% | 100% | 1 |
5 | YBL MIKLOS POLYTECH | 66963 | 0% | 100% | 1 |
6 | OPTIMIZAT CONTROL | 35446 | 1% | 18% | 3 |
7 | CRYPTOG INFORMAT SYST SURETY | 33480 | 0% | 50% | 1 |
8 | DISCRETE SIMULAT SCI | 33480 | 0% | 50% | 1 |
9 | MATH CEOC | 33480 | 0% | 50% | 1 |
10 | ROBOT ALGORITHMS MOT PLANNING | 33480 | 0% | 50% | 1 |
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 | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 114772 | 9% | 4% | 43 |
2 | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | 56452 | 5% | 4% | 23 |
3 | DISCRETE & COMPUTATIONAL GEOMETRY | 17167 | 5% | 1% | 23 |
4 | INFORMATION PROCESSING LETTERS | 8247 | 6% | 0% | 28 |
5 | GEOMETRIAE DEDICATA | 8063 | 4% | 1% | 19 |
6 | SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 7360 | 2% | 2% | 7 |
7 | PERIODICA MATHEMATICA HUNGARICA | 5141 | 1% | 2% | 5 |
8 | AEQUATIONES MATHEMATICAE | 5010 | 1% | 1% | 6 |
9 | ALGORITHMICA | 3527 | 2% | 0% | 11 |
10 | ARCHIV DER MATHEMATIK | 2976 | 3% | 0% | 15 |
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 | ART GALLERY PROBLEM | 1418868 | 6% | 76% | 28 | Search ART+GALLERY+PROBLEM | Search ART+GALLERY+PROBLEM |
2 | ART GALLERY | 1101997 | 5% | 69% | 24 | Search ART+GALLERY | Search ART+GALLERY |
3 | ORTHOGONAL POLYGONS | 524974 | 3% | 56% | 14 | Search ORTHOGONAL+POLYGONS | Search ORTHOGONAL+POLYGONS |
4 | ART GALLERY THEOREMS | 451993 | 2% | 75% | 9 | Search ART+GALLERY+THEOREMS | Search ART+GALLERY+THEOREMS |
5 | STAIRCASE PATHS | 267850 | 1% | 100% | 4 | Search STAIRCASE+PATHS | Search STAIRCASE+PATHS |
6 | VERTEX GUARDS | 267850 | 1% | 100% | 4 | Search VERTEX+GUARDS | Search VERTEX+GUARDS |
7 | TERRAIN GUARDING | 214278 | 1% | 80% | 4 | Search TERRAIN+GUARDING | Search TERRAIN+GUARDING |
8 | WATCHMAN ROUTE | 214278 | 1% | 80% | 4 | Search WATCHMAN+ROUTE | Search WATCHMAN+ROUTE |
9 | WATCHMAN ROUTE PROBLEM | 214278 | 1% | 80% | 4 | Search WATCHMAN+ROUTE+PROBLEM | Search WATCHMAN+ROUTE+PROBLEM |
10 | 15D TERRAIN | 200888 | 1% | 100% | 3 | Search 15D+TERRAIN | Search 15D+TERRAIN |
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 | GHOSH, SK , (2010) APPROXIMATION ALGORITHMS FOR ART GALLERY PROBLEMS IN POLYGONS.DISCRETE APPLIED MATHEMATICS. VOL. 158. ISSUE 6. P. 718-722 | 17 | 81% | 19 |
2 | BIEDL, T , IRFAN, MT , IWERKS, J , KIM, J , MITCHELL, JSB , (2012) THE ART GALLERY THEOREM FOR POLYOMINOES.DISCRETE & COMPUTATIONAL GEOMETRY. VOL. 48. ISSUE 3. P. 711-720 | 13 | 100% | 5 |
3 | DURNITRESCU, A , MITCHELL, JSB , ZYLINSKI, P , (2014) WATCHMAN ROUTES FOR LINES AND LINE SEGMENTS.COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS. VOL. 47. ISSUE 4. P. 527 -538 | 14 | 78% | 0 |
4 | SPILLNER, A , (2006) MINIMUM BOUNDARY TOUCHING TILINGS OF POLYOMINOES.MATHEMATICAL LOGIC QUARTERLY. VOL. 52. ISSUE 1. P. 29-36 | 11 | 92% | 0 |
5 | MICHAEL, TS , PINCIU, V , (2016) HOW TO GUARD ORTHOGONAL POLYGONS: DIAGONAL GRAPHS AND VERTEX COVERS.DISCRETE & COMPUTATIONAL GEOMETRY. VOL. 55. ISSUE 2. P. 410 -422 | 9 | 82% | 0 |
6 | KIRKPATRICK, D , (2015) AN O(LG LG OPT)-APPROXIMATION ALGORITHM FOR MULTI-GUARDING GALLERIES.DISCRETE & COMPUTATIONAL GEOMETRY. VOL. 53. ISSUE 2. P. 327 -343 | 12 | 60% | 0 |
7 | DUTT, M , BISWAS, A , BHOWMICK, P , (2013) APPROXIMATE PARTITIONING OF 2D OBJECTS INTO ORTHOGONALLY CONVEX COMPONENTS.COMPUTER VISION AND IMAGE UNDERSTANDING. VOL. 117. ISSUE 4. P. 326 -341 | 11 | 61% | 0 |
8 | KESZEGH, B , (2011) BOX-RESPECTING COLORINGS OF N-DIMENSIONAL GUILLOTINE-PARTITIONS.DISCRETE MATHEMATICS. VOL. 311. ISSUE 8-9. P. 756-760 | 7 | 100% | 0 |
9 | KATZ, MJ , ROISMAN, GS , (2008) ON GUARDING THE VERTICES OF RECTILINEAR DOMAINS.COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS. VOL. 39. ISSUE 3. P. 219-228 | 8 | 89% | 11 |
10 | WANG, JX , TAN, PQ , YAO, JY , FENG, QL , CHEN, JE , (2014) ON THE MINIMUM LINK-LENGTH RECTILINEAR SPANNING PATH PROBLEM: COMPLEXITY AND ALGORITHMS.IEEE TRANSACTIONS ON COMPUTERS. VOL. 63. ISSUE 12. P. 3092 -3100 | 9 | 69% | 1 |
Classes with closest relation at Level 1 |