{\obeylines\parskip=0pt
\def\n#1#2{\>\hbox to 6em{#1 \dotfill} #2}
-\def\[#1]{[\thmref{#1}]}
+\def\[#1]{[\ref{#1}]}
\n{$T[x,y]$}{the path in a tree~$T$ joining $x$ and $y$ \[heavy]}
-\n{$T[e]$}{the path in a tree~$T$ joining endpoints of an~edge~$e$ \[heavy]}
+\n{$T[e]$}{the path in a tree~$T$ joining the endpoints of an~edge~$e$ \[heavy]}
\n{$A\symdiff B$}{symetric difference of sets: $(A\setminus B) \cup (B\setminus A)$}
\n{$G-e$}{graph $G$ with edge $e$ removed}
\n{$G+e$}{graph $G$ with edge $e$ added}
\n{$w(e)$}{weight of an edge $e$}
-\n{$V(G)$}{the set of vertices of a graph~$G$}
-\n{$E(G)$}{the set of edges of a graph~$G$}
-\n{MST}{minimal spanning tree \[mstdef]}
-\n{MSF}{minimal spanning forest \[mstdef]}
+\n{$V(G)$}{set of vertices of a graph~$G$}
+\n{$E(G)$}{set of edges of a graph~$G$}
+\n{$n(G)$}{number of vertices of a graph~$G$, that is $\vert V(G)\vert$}
+\n{$m(G)$}{number of edges of a graph~$G$, that is $\vert E(G)\vert$}
+\n{$V,E,n,m$}{when used without $(G)$, they refer to the input of the current algorithm}
+\n{MST}{minimum spanning tree \[mstdef]}
+\n{MSF}{minimum spanning forest \[mstdef]}
+\n{$\mst(G)$}{the unique minimum spanning tree of a graph~$G$ \[mstnota]}
+\n{$X \choose k$}{a set of $k$-element subsets of a set~$X$}
+\n{$G/e$}{multigraph contraction \[contract]}
+\n{$G.e$}{simple graph contraction \[simpcont]}
+\n{$\alpha(n)$}{the inverse Ackermann's function}
+\n{$f[X]$}{function applied to a set: $f[X]:=\{ f(x) ; x\in X \}$.}
+\n{$\varrho({\cal C})$}{edge density of a graph class~$\cal C$ \[density]}
+\n{$\deg_G(v)$}{degree of vertex~$v$ in graph~$G$; we omit $G$ if it is clear from context}
+\n{${\bb E}X$}{expected value of a~random variable~$X$}
+\n{${\rm Pr}[\varphi]$}{probability that a predicate~$\varphi$ is true}
}
+\section{Multigraphs and contractions}
+
+Since the formalism of multigraphs is not fixed in the literature, we will
+better define it carefully, following \cite{diestel:gt}:
+
+\defn A~\df{multigraph} is an ordered triple $(V,E,M)$, where $V$~is the
+set of vertices, $E$~is the set of edges, taken as abstract objects disjoint
+with the vertices, and $M$ is a mapping $E\mapsto V \cup {V \choose 2}$
+which assigns to each edge either a pair of vertices or a single vertex
+(if the edge is a loop).
+
+\proclaim{Notation}%
+When the meaning is clear from the context, we use our notation originally
+defined for graphs even for multigraphs. For example, $xy\in E(G)$ becomes a
+shorthand for $\exists e\in E(G)$ such that $M(G)(e) = \{x,y\}$. Also, we
+consider multigraphs with no multiple edges nor loops and simple graphs to be
+the same objects, although they formally differ.
+
+\defn\id{contract}%
+Let $G=(V,E,M)$ be a multigraph and $e=xy$ its edge. \df{(Multigraph) contraction of~$G$ along~$e$}
+produces a multigraph $G/e=(V',E',M')$ such that:
+$$\eqalign{
+V' &= (V(G) \setminus \{x,y\}) \cup \{v_e\},\quad\hbox{where $v_e$ is a new vertex,}\cr
+E' &= E(G) - \{e\},\cr
+M'(f) &= \{ m(v) ; v\in M(f) \} \quad\hbox{for every $f=\in E'$, and}\cr
+m(x) &= \cases{v_e & \hbox{for $v=x,y,$}\cr v & \hbox{otherwise.}} \cr
+}$$
+
+Sometimes we need contraction for simple graphs as well. It corresponds to performing
+the multigraph contraction, unifying parallel edges and deleting loops.
+
+\defn\id{simpcont}%
+Let $G=(V,E)$ a simple graph and $e=xy$ its edge. \df{(Simple graph) contraction of~$G$ along~$e$}
+produces a graph $G.e=(V',E')$ such that:
+$$\eqalign{
+V' &= (V(G) \setminus \{x,y\}) \cup \{v_e\},\quad\hbox{where $v_e$ is a new vertex,}\cr
+E' &= \{ \{m(x),m(y)\} ; xy\in E \land m(x)\ne m(y) \},\cr
+m(x) &= \cases{v_e & \hbox{for $v=x,y,$}\cr v & \hbox{otherwise.}} \cr
+}$$
+
\endpart
projects / saga.git / blobdiff