Class information for: |
Basic class information |
ID | Publications | Average number of references |
Avg. shr. active ref. in WoS |
---|---|---|---|
3586 | 1876 | 22.4 | 48% |
Classes in level above (level 2) |
ID, lev. above |
Publications | Label for level above |
---|---|---|
191 | 20791 | JOURNAL OF GRAPH THEORY//DISCRETE MATHEMATICS//JOURNAL OF COMBINATORIAL THEORY SERIES B |
Terms with highest relevance score |
Rank | Term | Type of term | Relevance score (tfidf) |
Class's shr. of term's tot. occurrences |
Shr. of publ. in class containing term |
Num. of publ. in class |
---|---|---|---|---|---|---|
1 | TREE WIDTH | Author keyword | 110 | 49% | 9% | 162 |
2 | PARAMETERIZED COMPLEXITY | Author keyword | 110 | 52% | 8% | 149 |
3 | PATHWIDTH | Author keyword | 73 | 75% | 3% | 53 |
4 | CLIQUE WIDTH | Author keyword | 59 | 65% | 3% | 56 |
5 | RANK WIDTH | Author keyword | 50 | 86% | 1% | 25 |
6 | KERNELIZATION | Author keyword | 43 | 57% | 3% | 51 |
7 | PARAMETERIZED ALGORITHMS | Author keyword | 37 | 57% | 2% | 43 |
8 | FIXED PARAMETER TRACTABILITY | Author keyword | 34 | 37% | 4% | 75 |
9 | BRANCH WIDTH | Author keyword | 30 | 69% | 1% | 25 |
10 | EXPONENTIAL TIME ALGORITHMS | Author keyword | 28 | 81% | 1% | 17 |
Web of Science journal categories |
Author Key Words |
Rank | Web of Science journal category | Relevance score (tfidf) |
Class's shr. of term's tot. occurrences |
Shr. of publ. in class containing term |
Num. of publ. in class |
LCSH search | Wikipedia search |
---|---|---|---|---|---|---|---|
1 | TREE WIDTH | 110 | 49% | 9% | 162 | Search TREE+WIDTH | Search TREE+WIDTH |
2 | PARAMETERIZED COMPLEXITY | 110 | 52% | 8% | 149 | Search PARAMETERIZED+COMPLEXITY | Search PARAMETERIZED+COMPLEXITY |
3 | PATHWIDTH | 73 | 75% | 3% | 53 | Search PATHWIDTH | Search PATHWIDTH |
4 | CLIQUE WIDTH | 59 | 65% | 3% | 56 | Search CLIQUE+WIDTH | Search CLIQUE+WIDTH |
5 | RANK WIDTH | 50 | 86% | 1% | 25 | Search RANK+WIDTH | Search RANK+WIDTH |
6 | KERNELIZATION | 43 | 57% | 3% | 51 | Search KERNELIZATION | Search KERNELIZATION |
7 | PARAMETERIZED ALGORITHMS | 37 | 57% | 2% | 43 | Search PARAMETERIZED+ALGORITHMS | Search PARAMETERIZED+ALGORITHMS |
8 | FIXED PARAMETER TRACTABILITY | 34 | 37% | 4% | 75 | Search FIXED+PARAMETER+TRACTABILITY | Search FIXED+PARAMETER+TRACTABILITY |
9 | BRANCH WIDTH | 30 | 69% | 1% | 25 | Search BRANCH+WIDTH | Search BRANCH+WIDTH |
10 | EXPONENTIAL TIME ALGORITHMS | 28 | 81% | 1% | 17 | Search EXPONENTIAL+TIME+ALGORITHMS | Search EXPONENTIAL+TIME+ALGORITHMS |
Key Words Plus |
Rank | Web of Science journal category | Relevance score (tfidf) |
Class's shr. of term's tot. occurrences |
Shr. of publ. in class containing term |
Num. of publ. in class |
---|---|---|---|---|---|
1 | TREE WIDTH | 111 | 42% | 11% | 205 |
2 | PATHWIDTH | 49 | 66% | 2% | 46 |
3 | GRAPH MINORS | 37 | 49% | 3% | 55 |
4 | DOMINATING SET | 31 | 49% | 2% | 45 |
5 | TRACTABILITY | 30 | 38% | 3% | 64 |
6 | FIXED PARAMETER ALGORITHMS | 27 | 74% | 1% | 20 |
7 | BRANCH WIDTH | 26 | 61% | 1% | 28 |
8 | MINORS | 25 | 19% | 6% | 118 |
9 | MINIMUM FILL IN | 23 | 62% | 1% | 24 |
10 | MONADIC 2ND ORDER LOGIC | 21 | 34% | 3% | 51 |
Journals |
Reviews |
Title | Publ. year | Cit. | Active references | % act. ref. to same field |
---|---|---|---|---|
A partial k-arboretum of graphs with bounded treewidth | 1998 | 320 | 60 | 83% |
Width parameters beyond tree-width and their applications | 2008 | 39 | 116 | 56% |
Parameterized complexity and approximation algorithms | 2008 | 36 | 63 | 49% |
Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems | 2008 | 17 | 54 | 39% |
Solving Problems on Recursively Constructed Graphs | 2008 | 1 | 85 | 81% |
Exact Exponential Algorithms | 2013 | 0 | 12 | 58% |
Some recent progress and applications in graph minor theory | 2007 | 5 | 108 | 35% |
ITS TIME TO RECONSIDER TIME | 1994 | 1 | 1 | 100% |
Address terms |
Rank | Address term | Relevance score (tfidf) |
Class's shr. of term's tot. occurrences |
Shr. of publ. in class containing term |
Num. of publ. in class |
---|---|---|---|---|---|
1 | SOFTWARETECH THEORET INFORMAT | 7 | 31% | 1.0% | 19 |
2 | ABT MATH LOG | 7 | 42% | 0.7% | 13 |
3 | WILHELM ICKARD INFORMAT | 6 | 16% | 1.8% | 34 |
4 | FB ABT INFORMAT 4 | 5 | 54% | 0.4% | 7 |
5 | OFF DVC | 5 | 63% | 0.3% | 5 |
6 | LIFO | 5 | 20% | 1.1% | 21 |
7 | INFORMAT FONDAMENTALE ORLEANS | 4 | 33% | 0.5% | 10 |
8 | CNRSUMR 7243 | 3 | 100% | 0.2% | 3 |
9 | INFORMAT THEOR PL | 3 | 25% | 0.6% | 11 |
10 | ALGCO PROJECT TEAM | 3 | 50% | 0.2% | 4 |
Related classes at same level (level 1) |
Rank | Relatedness score | Related classes |
---|---|---|
1 | 0.0000205852 | LINEAR DISCREPANCY//ANTIBANDWIDTH//WEAK DISCREPANCY |
2 | 0.0000175995 | COPS AND ROBBERS//COPS AND ROBBER//PURSUIT EVASION |
3 | 0.0000157573 | VERTEX COVER//DIFFERENTIAL RATIO//PRIORITY ALGORITHMS |
4 | 0.0000147798 | INTEGRAL SUM GRAPH//SUM GRAPH//HADWIGERS CONJECTURE |
5 | 0.0000142891 | PERFECT GRAPHS//DISTANCE HEREDITARY GRAPHS//EVEN PAIR |
6 | 0.0000094361 | MINIMUM CUTS//MA ORDERING//GRAPH AUGMENTATION |
7 | 0.0000089864 | STRONG CHROMATIC INDEX//INCIDENCE COLORING//INDUCED MATCHING |
8 | 0.0000088268 | DICHOTOMY THEOREM//HOLOGRAPHIC ALGORITHMS//HEDETNIEMIS CONJECTURE |
9 | 0.0000079166 | BOOTSTRAP PERCOLATION//FEEDBACK VERTEX SET//DYNAMIC MONOPOLIES |
10 | 0.0000077819 | CLIQUE RELAXATIONS//MAXIMUM CLIQUE PROBLEM//MAXIMUM CLIQUE |