--- title: Constrained Incremental Graph Drawing Problem url: https://www.emergentmind.com/topics/constrained-incremental-graph-drawing-problem-c-igdp type: topic --- # Constrained Incremental Graph Drawing Problem The Constrained Incremental Graph Drawing Problem (C-IGDP), as formalized in recent work, is a hierarchical graph visualization problem in which an original multilayer drawing is updated by inserting incremental vertices and arcs while preserving the user’s mental map through two explicit feasibility conditions: the relative order of original vertices in each layer must remain unchanged, and the absolute displacement of each original vertex is bounded by a parameter \(d\). The optimization goal is to minimize the number of crossings in the resulting incremental drawing [2508.15949]. In a broader research interpretation, C-IGDP also sits within a larger family of constrained extension and redraw problems in which a pre-existing drawing, embedding, region assignment, or geometric convention restricts how new graph elements may be inserted or how an existing layout may be adjusted. ## 1. Canonical multilayer formulation In the formulation studied explicitly under the name C-IGDP, the original drawing is \(\mathcal{D}=(G,\Pi_0)\), where \(G=(V,A,\Lambda)\) is a multilayer graph, \(V^\lambda\) is the set of vertices in layer \(\lambda\), \(A^\lambda\) is the set of arcs leaving layer \(\lambda\), and \(\Lambda\) is the number of layers. The position functions are \(\Pi_0=\{\pi_0^1,\ldots,\pi_0^\Lambda\}\), with \(\pi_0^\lambda:V^\lambda\mapsto\{1,\ldots,|V^\lambda|\}\). Incremental vertices \(\widehat V=\widehat V^1\cup\cdots\cup \widehat V^\Lambda\) and incremental arcs \(\widehat A=\widehat A^1\cup\cdots\cup \widehat A^{\Lambda-1}\) are then added, yielding the incremental graph \(IG=(IV,IA,\Lambda)\), with \(IV^\lambda=V^\lambda\cup\widehat V^\lambda\) and \(IA^\lambda=A^\lambda\cup\widehat A^\lambda\) [2508.15949]. Arc crossings are defined layerwise. Two arcs \((a,b)\) and \((c,d)\), with \(a,c\in V^{\lambda-1}\) and \(b,d\in V^\lambda\), cross if the order of their tails is opposite to the order of their heads, namely either \(\pi_0^{\lambda-1}(a)<\pi_0^{\lambda-1}(c)\) and \(\pi_0^\lambda(b)>\pi_0^\lambda(d)\), or the symmetric alternative. The output is a new drawing \(\mathcal I=(IG,\Pi)\), where \(\Pi=\{\pi^1,\ldots,\pi^\Lambda\}\) gives final positions [2508.15949]. Feasibility is defined by two constraints on original vertices. First, relative precedence is preserved: for all original vertices \(i,j\in V^\lambda\), \[ \pi^\lambda(i) < \pi^\lambda(j) \iff \pi_0^\lambda(i) < \pi_0^\lambda(j). \] Second, absolute displacement is bounded: \[ |\pi_0^\lambda(i)-\pi^\lambda(i)|\le d,\quad \forall i\in V. \] This makes the incremental task neither a complete redraw nor an unconstrained crossing minimization problem. The original ordering acts as a hard combinatorial invariant, while \(d\) imposes a hard geometric tolerance on positional perturbation [2508.15949]. The mixed-integer formulation uses binary precedence variables \(x_{ij}^\lambda\), crossing variables \(c_{iwjz}^\lambda\), and integer position variables \(\pi^\lambda(i)\). Its objective is \[ \min \sum_{\lambda=1}^{\Lambda-1} \sum_{(i,w),(j, z) \in {IA}^{\lambda}, i \prec j, z \neq w} c_{iwjz}^{\lambda}, \] subject to crossing-definition constraints, transitivity and completeness of precedence, preservation of original relative order, displacement bounds, and the link between precedence variables and final positions: \[ \pi^{\lambda}(i) = |IV^{\lambda}| - \sum_{j=1, j \neq i}^{|IV^{\lambda}|} x_{ij}^{\lambda}. \] The unconstrained IGDP is obtained by using constraints (1)–(6) and (10), i.e., without the absolute-position restrictions [2508.15949]. ## 2. Heuristic and hybrid solution methods The principal prior methods emphasized for C-IGDP are GRASP-based heuristics, especially GRASP2 and GRASP3, together with a Tabu Search. Standard GRASP is iterative: a semi-greedy construction generates a feasible solution, local search improves it, and the best solution over all iterations is retained. A restricted candidate list (RCL) contains the best \(\varphi \times 100\%\) candidates according to a greedy score, where \(\varphi\in[0,1]\) controls greediness versus randomness [2508.15949]. Three earlier construction procedures are described. In \(C_1\), a high-degree vertex is first selected and placed randomly, and remaining vertices are chosen semi-greedily by degree and placed by the barycenter heuristic. In \(C_2\), the original drawing is used as the initial partial solution, and only incremental vertices are inserted semi-greedily. In \(C_3\), the key score is insertion cost: \(\varrho(\nu,p)\) denotes the number of additional crossings caused by inserting vertex \(\nu\) at position \(p\), and \(\varrho(\nu)\) is the minimum over positions. The RCL threshold is \[ \xi = \min_{\nu \in L} \varrho(\nu) + \varphi \left( \max_{\nu \in L} \varrho(\nu) - \min_{\nu \in L} \varrho(\nu) \right). \] The local search of the literature heuristics uses two neighborhoods, swap and insert, both restricted to incremental vertices and both preserving the constraints on original vertices [2508.15949]. The hybrid method proposed specifically for C-IGDP is Graph Learning GRASP (GL-GRASP). It retains the overall GRASP structure and the same local search, but replaces the construction phase by one guided by graph representation learning. Its preprocessing step computes node embeddings for all vertices of the incremental graph \(IG\), projects them into \(2\)-D by PCA, and computes Euclidean distances between adjacent nodes in this projected space. These latent-space distances are then used as heuristic attributes during semi-greedy insertion [2508.15949]. The node score in GL-GRASP is \[ \mathcal{G}(u)=\min_{(u,v),(v,u)\in \mathcal{I}'} d(v,u), \] where \(\mathcal I'\) is the current partial solution. The RCL is defined by \[ RCL = \{ \nu \in CL : \mathcal G(\nu)\le \xi\}, \] with \[ \xi = \min_{\nu \in CL}\mathcal G(\nu) + \varphi\left(\max_{\nu \in CL}\mathcal G(\nu)-\min_{\nu \in CL}\mathcal G(\nu)\right). \] Selected vertices are placed using three embedding-informed positional mechanisms: the closest available position to the nearest neighbor in an adjacent layer, the closest available position to the farthest neighbor in an adjacent layer, and the closest available position to the average of the positions already collected in the candidate set \(P\). The paper interprets these choices as preserving community structure, avoiding excessive clustering, and enabling smooth intermediate placement [2508.15949]. The embedding methods evaluated are HOPE, Spectral (SPEC), Node2Vec (N2V), and SDNE. The stochastic variants G_N2V* and G_SDNE* recompute embeddings and the distance matrix at every GRASP iteration, whereas the standard variants compute embeddings once and reuse them. The implementation uses CogDL defaults; for N2V and SDNE the default embedding dimension is \(k=128\), while for HOPE and SPEC the dimension depends on graph size according to the CogDL implementation [2508.15949]. ## 3. Empirical behavior and evaluation The experimental methodology centers on the Normalized Primal Integral (NPI), which measures solution quality over time rather than final quality alone. Let \(f^*_{heur}\) be the best solution value among all GL-GRASP heuristics for an instance, let \(f(0)=1.1\times f^*_{heur}\), and let \(T_{max}\) be the maximum time among all GL-GRASP heuristics on that instance. If \(f(1),\dots,f(n_s)\) are the successive improving solution values found at times \(t(1),\dots,t(n_s)\), then \[ \mbox{NPI} = \frac{\sum_{i=1}^{n_s}[f(i-1)\times (t(i)-t(i-1))] + f(n_s)\times (T_{max}-t(n_s))} {T_{max}\times f^*_{heur}}. \] Lower NPI is better. This measure is central because the paper’s main claim is a quality–time improvement, not merely an improved final crossing count [2508.15949]. The benchmark dataset contains 609 test cases derived from 240 base instances. Original hierarchical graphs have \(2\), \(6\), \(13\), or \(20\) layers, density \(\rho\in\{0.065,0.175,0.300\}\), and \(5\) to \(30\) non-incremental vertices per layer; the incremental ratio is \(Inc=0.2\) or \(Inc=0.6\), and \(d\in\{1,2,3\}\). A second scalability experiment uses denser, larger instances with \(\Lambda\in\{2,3,4,5\}\), density reported as \(0.5\), \(Inc=0.60\), \(d\in\{1,2,3\}\), and \(60\)–\(80\) original nodes per layer [2508.15949]. In the first experiment, which compares only GL-GRASP variants, G_SPEC attains the lowest mean gap, \(0.278\), with mean time \(1258.72\) s, while G_SDNE attains the best mean runtime, \(1153.23\) s, with mean gap \(0.283\). By NPI, however, G_HOPE and G_SDNE are best overall, with mean NPI values \(0.267\) and \(0.268\), respectively, followed by G_SPEC at \(0.271\). At \(\tau=1\) in the NPI performance profile, G_SDNE is best on \(42\%\) of instances, G_HOPE on \(30\%\), G_SPEC on \(16\%\), and G_N2V on \(10\%\). The stochastic variants are markedly slower and substantially worse by NPI because recomputing embeddings each iteration is expensive [2508.15949]. The second experiment compares G_HOPE and G_SDNE against GRASP2 and GRASP3. | Method | Mean gap / time | Mean NPI | |---|---:|---:| | GRASP2 | \(0.348\) / \(1112.65\) s | \(0.366\) | | GRASP3 | \(0.257\) / \(1754.55\) s | \(0.357\) | | G_HOPE | \(0.280\) / \(1173.57\) s | \(0.308\) | | G_SDNE | \(0.283\) / \(1153.23\) s | \(0.309\) | These results indicate that GRASP3 attains the best average final gap, but GL-GRASP variants are much better by primal integral. The class-wise comparison is sharper: GRASP3 dominates in lower-layer or easier cases, especially with \(2\) or \(6\) layers and low density \(\rho=0.065\), whereas G_HOPE and G_SDNE surpass GRASP3 on average gap for larger and denser instances, such as \(\Lambda=13,\rho=0.175\) and \(\Lambda=20,\rho=0.300\). The Wilcoxon signed-rank tests at \(5\%\) significance show no significant difference in gap among GRASP3, G_HOPE, and G_SDNE, but GRASP3 is significantly slower than G_HOPE and G_SDNE [2508.15949]. The third experiment strengthens the scalability claim. On the denser large instances, G_HOPE and G_SDNE both attain mean gap \(0.007\), compared with \(0.021\) for GRASP2, \(1.462\) for GRASP3, and \(0.665\) for Gurobi under the stated time limit. The paper reports that each of G_HOPE and G_SDNE achieved the best gap in \(8\) of the \(12\) instances. This suggests that the hybridization is particularly effective when density and structural complexity increase [2508.15949]. An important nuance is that the learned construction is not superior as a pure constructor. The average construction-only gaps are \(12.876\) for \(C_2\), \(5.846\) for \(C_3\), \(15.302\) for \(C_{\text{HOPE}}\), and \(15.371\) for \(C_{\text{SDNE}}\). After local search, however, GRASP3, G_HOPE, and G_SDNE end with very similar average crossing counts, while the learning-based variants are substantially faster. The main empirical contribution of graph representation learning is therefore a more favorable quality–time balance, not a better initial crossing count in isolation [2508.15949]. ## 4. Complexity landscape and closely related formal variants A broader understanding of C-IGDP is shaped by adjacent constrained extension problems in straight-line, orthogonal, grid, and region-constrained drawing. One especially relevant model is Graph in Polygon: given a planar graph \(G\) and a polygonal region \(R\), with some vertices fixed on the boundary of \(R\), determine whether the remaining vertices can be placed to obtain a planar straight-line drawing inside \(R\). This model generalizes partial planar drawing extension and is directly described as a geometric feasibility version of constrained incremental planar drawing with fixed vertex placements, region constraints, straight-line edges, and exact planarity preservation. Its main result is that Graph in Polygon is \(\exists\mathbb{R}\)-complete, whether the graph is given abstractly or with a combinatorial embedding, and the paper also proves that integer-coordinate inputs may force irrational coordinates in every valid drawing. The complexity remains open for a simply connected region [1802.06699]. A second nearby model is Bend-Minimal Orthogonal Extension (BMOE), where a connected subgraph \(H\) is already drawn orthogonally and planarly, and the task is to insert the missing vertices and edges so that the full graph has a planar orthogonal drawing extending \(\Gamma(H)\), while minimizing bends on the inserted part. The paper establishes fixed-parameter tractability with respect to \[ \kappa = |V(G)\setminus V(H)| + |E(G)\setminus E(H)|, \] via a reduction to a single-face insertion problem, bend-equivalent sectors, a sector graph of bounded treewidth, a global point-grid discretization, and dynamic programming. Its final result states that BMOE can be solved in time \(2^{\kappa^{O(1)}}\cdot n\), where \(n\) is the number of feature points of \(\Gamma(H)\). This is a direct positive result for a specialized but important constrained incremental model [2302.10046]. Topologically-Safe Snapping (TSS) studies a different re-optimization regime: a plane straight-line drawing must be moved to integer grid points inside a bounding box while preserving topological equivalence, straight-line edges, and cyclic orders around vertices, with objective \[ \min \sum_{v \in V} |x_v - X_v| + |y_v - Y_v|. \] The paper proves NP-hardness for total Manhattan movement, total Euclidean movement, and Euclidean maximum movement, and provides an ILP whose constraints enforce vertex distinctness, noncrossing of nonincident edges, direction assignments, and preservation of cyclic order. In a C-IGDP interpretation, this is an embedding-preserving incremental redraw problem rather than an insertion problem [1608.08844]. Region-constrained clustered drawing yields yet another complexity boundary. For a flat clustered graph \((G,\mathcal C)\) and a disk arrangement \(D_{\mathcal C}\), every simple clustered graph with a \(\DiskMap\)-framed embedding has a \(\DiskMap\)-framed straight-line drawing homeomorphic to that embedding when the disk arrangement has no pipe-disk intersections. If that condition is dropped, deciding existence becomes NP-hard, even when the clustered graph has maximum degree \(5\) in the disk setting. This result is especially relevant when incremental constraints are interpreted as progressively imposed territorial regions and routing corridors [1811.00785]. Taken together, these results suggest that the computational status of “constrained incremental drawing” depends strongly on the representation model. Exact straight-line extension with region constraints can reach \(\exists\mathbb{R}\)-completeness, orthogonal extension with a small missing subgraph can be fixed-parameter tractable, embedding-preserving grid snapping is NP-hard, and clustered region assignments exhibit a sharp positive/negative boundary depending on whether pipes intersect foreign disks. ## 5. Dynamic, interactive, and continuous optimization perspectives Several papers do not formalize C-IGDP under that exact name, but they articulate mechanisms that are directly relevant to broader constrained incremental drawing. One line uses force-directed optimization with soft and hard constraints. A constraint-based framework for grid-like layout combines a P-stress objective with additional soft terms, \[ \mbox{P-stress} + k_{ns}\cdot\mbox{NS-stress} + k_{gs}\cdot\mbox{GS-stress}+k_{en}\cdot\mbox{EN-sep}, \] and hard constraints handled by projection. Its Adaptive Constrained Alignment (ACA) mechanism greedily inserts hard separated alignments such as \[ \mathsf{SA}(u,v,\mathbb{N}) \equiv x_u = x_v \ \text{and}\ y_v + \beta(u,v) \leq y_u, \] with conflict resolution that distinguishes definite user constraints from tentative automatically generated constraints. The system is implemented in Dunnart, where automatic layout runs continuously in a background worker thread, allowing the layout to adapt immediately to user-specified changes to positions or constraints. This is a practically incremental, editor-oriented model rather than a formal dynamic algorithm [1308.6368]. A complementary optimization engine is pairwise stochastic gradient descent for stress minimization. The stress objective is \[ \text{stress}(\mathbf{X}) = \sum_{i