gentle
发表于 2025-3-23 10:25:50
http://reply.papertrans.cn/39/3881/388013/388013_11.png
Wallow
发表于 2025-3-23 14:07:20
http://reply.papertrans.cn/39/3881/388013/388013_12.png
肌肉
发表于 2025-3-23 19:35:04
https://doi.org/10.1007/978-3-7091-3721-5lgorithms from classical graph theory, and for algorithms implemented on networks of communicating processors and distributed systems. Moreover, this theory gives an algebraic model which allows us to mathematically prove properties of distributed algorithms.
有角
发表于 2025-3-23 22:39:24
https://doi.org/10.1007/978-1-349-18070-7in be generated by a hyperedge-replacement grammar. Because many familiar graph-theoretic properties like connectedness, .-colorability, planarity, the existence of Eulerian and Hamiltonian paths and cycles, etc. are compatible and compatibility is closed under Boolean operations, the members of a h
遗传
发表于 2025-3-24 05:25:01
http://reply.papertrans.cn/39/3881/388013/388013_15.png
figure
发表于 2025-3-24 07:35:03
http://reply.papertrans.cn/39/3881/388013/388013_16.png
BAIL
发表于 2025-3-24 12:13:49
http://reply.papertrans.cn/39/3881/388013/388013_17.png
Militia
发表于 2025-3-24 18:09:52
https://doi.org/10.1007/978-3-031-47884-0or (1) we propose grid embeddings of graphs and measure ”nice” by algorithmic cost measures of the embeddings, e.g., area, expansion, edge length, etc. For (2) we prove that optimal embeddings with fixed costs are NP-complete, even for binary trees. This sharpens previous NP-completeness results of
反抗者
发表于 2025-3-24 19:18:29
https://doi.org/10.1007/978-3-031-31104-8rected distance graph with groups of required vertices and Steiner vertices, find a shortest connected subgraph containing at least one required vertex of each group. We propose two efficient approximation algorithms computing different approximate solutions in time .(|.| + |.|log|.|) and in time .(
concert
发表于 2025-3-25 01:17:20
https://doi.org/10.1007/978-3-031-31111-6thm which requires O(n.) time. However, in the average case, C.(G) is computed by this algorithm for almost all integers k (in the asymptotic sense) with O ≦ k ≦ 2n − 2 in O(n.) time. We next present a parallel algorithm which requires O(n. log n) time. In the average case, this algorithm computes C