Lines Matching refs:multiplicity

175 invariant number $i$ is called the \emph{invariant multiplicity} for
210 invariants. We examine vertices with low invariant multiplicity
211 before examining vertices with high invariant multiplicity.
227 order the roots of our DFS trees by invariant multiplicity.
255 vertex ordering, first ordering the vertices by invariant multiplicity
267   @<Compute invariant multiplicity@>
268   @<Sort vertices by invariant multiplicity@>
423 Next we compute the invariant multiplicity, the number of vertices
426 graph to record the multiplicity.
428 @d Compute invariant multiplicity
435 \noindent We then order the vertices by their invariant multiplicity.
444 @d Sort vertices by invariant multiplicity
463 @d Compare multiplicity predicate
509 DFS tree's to be ordered by invariant multiplicity. We call
1026   @<Compare multiplicity predicate@>