No label defined (Q4952671)

Let \(G=(V,E)\) be a simple graph \(G=(V,E)\) and \(P=(N,\subset)\) an in-tree order where each node \(n \in N\) is a subset of \(V\). More precisely, the Hasse diagram of \(P\) is a tree with unique maximal element \(V\) and minimal elements \(\{v\}\) for all \(v \in V\) and if \(n_1, n_2, \ldots, n_k\) are the immediate predecessors of \(n \in N\) then \(n = n_1 \cup n_2 \cup \cdots \cup n_k\) holds. Each anti-chain \(U \subseteq N\) defines a view \(G/U\), that is the simple graph we obtain from \(G\) by shrinking each set \(u \in U\) to a single representative node (and deleting resulting multiple edges and loops). The paper provides data structures to maintain such views of \(G\) if a node \(u \in U\) is replaced by the set of its immediate predecessors or the inverse operation. For the entire collection see [Zbl 0933.00039].