Class information for:
Level 1: MINIMUM CUTS//MA ORDERING//GRAPH AUGMENTATION

Basic class information
ID Publications Average number
of references		 Avg. shr. active
ref. in WoS
15152 659 18.1 37%


Bar chart of Publication_year

Last years might be incomplete

Classes in level above (level 2)


ID, lev.
above		 Publications Label for level above
774 11629 COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS//COMPUTATIONAL GEOMETRY//APPROXIMATION ALGORITHMS

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 MINIMUM CUTS Author keyword 22 67% 3% 20
2 MA ORDERING Author keyword 18 89% 1% 8
3 GRAPH AUGMENTATION Author keyword 14 60% 2% 15
4 K WAY CUT Author keyword 12 86% 1% 6
5 EDGE SPLITTING Author keyword 10 61% 2% 11
6 MULTIWAY CUT Author keyword 10 57% 2% 12
7 EDGE CONNECTIVITY AUGMENTATION Author keyword 8 70% 1% 7
8 MINIMUM CUT Author keyword 8 26% 4% 28
9 CONNECTIVITY AUGMENTATION Author keyword 7 48% 2% 11
10 EDGE CONNECTIVITY Author keyword 7 18% 5% 35

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 MINIMUM CUTS 22 67% 3% 20 Search MINIMUM+CUTS Search MINIMUM+CUTS
2 MA ORDERING 18 89% 1% 8 Search MA+ORDERING Search MA+ORDERING
3 GRAPH AUGMENTATION 14 60% 2% 15 Search GRAPH+AUGMENTATION Search GRAPH+AUGMENTATION
4 K WAY CUT 12 86% 1% 6 Search K+WAY+CUT Search K+WAY+CUT
5 EDGE SPLITTING 10 61% 2% 11 Search EDGE+SPLITTING Search EDGE+SPLITTING
6 MULTIWAY CUT 10 57% 2% 12 Search MULTIWAY+CUT Search MULTIWAY+CUT
7 EDGE CONNECTIVITY AUGMENTATION 8 70% 1% 7 Search EDGE+CONNECTIVITY+AUGMENTATION Search EDGE+CONNECTIVITY+AUGMENTATION
8 MINIMUM CUT 8 26% 4% 28 Search MINIMUM+CUT Search MINIMUM+CUT
9 CONNECTIVITY AUGMENTATION 7 48% 2% 11 Search CONNECTIVITY+AUGMENTATION Search CONNECTIVITY+AUGMENTATION
10 EDGE CONNECTIVITY 7 18% 5% 35 Search EDGE+CONNECTIVITY Search EDGE+CONNECTIVITY

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 EDGE CONNECTIVITY 17 40% 5% 34
2 MULTIWAY CUT 14 57% 2% 16
3 3 CUT PROBLEM 12 86% 1% 6
4 MINIMUM AUGMENTATION 12 86% 1% 6
5 AUGMENTATION PROBLEMS 7 56% 1% 9
6 MIN CUT ALGORITHM 6 80% 1% 4
7 SUBMODULAR FUNCTIONS 6 53% 1% 8
8 MINIMUM CUTS 5 40% 2% 10
9 VERTEX CONNECTIVITY 4 28% 2% 11
10 IMPROVED PARALLEL ALGORITHM 3 100% 0% 3

Journals

Reviews


Title Publ. year Cit. Active
references		 % act. ref.
to same field
Efficient Maximum Flow Algorithms 2014 1 10 70%
THE MAXIMUM FLOW PROBLEM - A MAX-PREFLOW APPROACH 1991 6 11 82%
Soul of circuit theory - A review on research activities of graphs and circuits in Japan 1999 0 13 31%

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 ERATO KAWARABAYASHI LARGE GR H PROJECT 2 67% 0.3% 2
2 THEORET TECH COMP SCI 2 67% 0.3% 2
3 RADIPHIS 1 100% 0.3% 2
4 MTA ELTE EGERVARY GRP 1 24% 0.6% 4
5 INFRASTRUCT TECHNOL 1 22% 0.6% 4
6 CNRS URA 1398 1 50% 0.2% 1
7 EGERVARY GRP 1 50% 0.2% 1
8 EGERVARY GRP EG 1 50% 0.2% 1
9 H D188 1 50% 0.2% 1
10 LIP UMR CNRS 1 50% 0.2% 1

Related classes at same level (level 1)


Rank Relatedness score Related classes
1 0.0000278034 BASE POLYHEDRON//DISCRETE CONVEX FUNCTION//SUBMODULAR FUNCTION
2 0.0000222772 DYNAMIC GRAPH ALGORITHMS//REPLACEMENT PATHS//SHORTEST PATHS
3 0.0000183722 APPROXIMATION ALGORITHMS//RANGE ASSIGNMENT//MINIMUM ENERGY BROADCAST
4 0.0000176224 PATH COLORING//K SPLITTABLE FLOW//PARTITIONED OPTICAL PASSIVE STARS NETWORK
5 0.0000129193 GENERALIZED ROUNDNESS//METRIC EMBEDDINGS//LIPSCHITZ FREE SPACE
6 0.0000094361 TREE WIDTH//PARAMETERIZED COMPLEXITY//PATHWIDTH
7 0.0000090197 VERTEX COVER//DIFFERENTIAL RATIO//PRIORITY ALGORITHMS
8 0.0000089241 NETWORK SIMPLEX ALGORITHM//DUAL SIMPLEX ALGORITHM//GENERALIZED CIRCULATION
9 0.0000074431 MATRIX CHAIN PRODUCT//OPTERON//SUBLINEAR TIME
10 0.0000073515 INVERSE OPTIMIZATION//OPTIMIZAT DISCRETE MATH//BALANCED OPTIMIZATION