1NDMETIS(1)                       User Commands                      NDMETIS(1)
2
3
4

NAME

6       ndmetis  -  Computes  a  fill-reducing  ordering of the vertices of the
7       graph using multilevel nested dissection.
8

SYNOPSIS

10       ndmetis [options] <filename>
11

DESCRIPTION

13              Required parameters
14
15       filename
16              Stores the graph to be partitioned.
17
18              Optional parameters
19
20       -ctype=string
21
22              Specifies the scheme to be used to match  the  vertices  of  the
23              graph during the coarsening.  The possible values are:
24
25       rm     - Random matching
26
27       shem   - Sorted heavy-edge matching [default]
28
29       -iptype=string [applies only when -ptype=rb]
30
31              Specifies the scheme to be used to compute the initial bisection
32              of the graph.  The possible values are:
33
34       edge   - Separator from an edge cut
35
36       node   - Separator from a greedy node-based strategy [default]
37
38       -rtype=string
39
40              Specifies the scheme to be used for  refinement.   The  possible
41              values are:
42
43       1sided
44              - 1-sided node-based refinement [default]
45
46       2sided - 2-sided node-based refinement
47
48       -ufactor=int
49
50              Specifies  the  maximum  allowed load imbalance between the left
51              and right partitions during each bisection. The load  imbalanced
52              is  measured as the ratio of the 2*max(left,right)/(left+right),
53              where left and right are the sizes of the respective partitions.
54              A  value  of  x  indicates  that  the  allowed load imbalance is
55              1+x/1000.  Default is 200, indicating a load imbalance of 1.20.
56
57       -pfactor=int
58
59              Specifies the minimum  degree  of  the  vertices  that  will  be
60              ordered  last.  If the specified value is x>0, then any vertices
61              with a degree greater than 0.1*x*(average  degree)  are  removed
62              from  the graph, an ordering of the rest of the vertices is com‐
63              puted, and an overall  ordering  is  computed  by  ordering  the
64              removed  vertices  at  the end of the overall ordering.  Default
65              value is 0, indicating that no vertices are removed
66
67       -no2hop
68
69              Specifies that the coarsening will not perform any 2-hop  match‐
70              ings  when  the standard matching fails to sufficiently contract
71              the graph.
72
73       -nocompress
74
75              Specifies that the graph should not be compressed  by  combining
76              together vertices that have identical adjacency lists.
77
78       -ccorder
79
80              Specifies  if the connected components of the graph should first
81              be identified and ordered separately.
82
83       -niter=int
84
85              Specifies the maximum number of iterations  for  the  refinement
86              algorithms at each stage of the uncoarsening process. Default is
87              10.
88
89       -nseps=int
90
91              Specifies the number of different separators that it  will  com‐
92              pute at each level of the nested dissection. The final separator
93              that is used is the smallest one. Default is 1.
94
95       -nooutput
96
97              Specifies that no ordering file should be generated.
98
99       -seed=int
100
101              Selects the seed of the random number generator.
102
103       -dbglvl=int
104
105              Selects the dbglvl.
106
107       -help
108
109              Prints this message.
110
111
112
113ndmetis 5.1.0                      July 2019                        NDMETIS(1)