outer-ear
发表于 2025-3-23 11:27:20
http://reply.papertrans.cn/39/3880/387910/387910_11.png
Ascribe
发表于 2025-3-23 17:51:34
CABRI-Graph: A tool for research and teaching in graph theory,We present the graph visualization and computional system CABRI-Graph, an interactive tool that can be used by student, teacher or researcher. The user may construct graphs interactively, select algorithms or graph transformations from a menu, and view the results directly on the screen
食草
发表于 2025-3-23 19:42:03
http://reply.papertrans.cn/39/3880/387910/387910_13.png
用树皮
发表于 2025-3-23 22:22:02
http://reply.papertrans.cn/39/3880/387910/387910_14.png
decipher
发表于 2025-3-24 06:08:21
Adocs: a drawing system for generic combinatorial structures,ogram. The program is based on a generic description of the structures, and thus allows to draw structures of an infinite number of classes. It can be used in order to produce graphical output for Gaïa, an uniform random generator of combinatorial structures. It could be used with other programs and
加强防卫
发表于 2025-3-24 08:26:31
The effect of graph layout on inference from social network data, We investigate the effect of the layout of a social network on the inferences drawn by observers about the number of social groupings evident and the centrality of various actors in the network. We conducted an experiment in which eighty subjects provided answers about three drawings. The subjects
扩大
发表于 2025-3-24 10:46:37
http://reply.papertrans.cn/39/3880/387910/387910_17.png
轻打
发表于 2025-3-24 16:22:02
http://reply.papertrans.cn/39/3880/387910/387910_18.png
Amorous
发表于 2025-3-24 19:12:43
http://reply.papertrans.cn/39/3880/387910/387910_19.png
空气
发表于 2025-3-25 03:11:08
On the complexity of recognizing intersection and touching graphs of disks, overlap. In a previous paper , we showed that the recognition problem for . disk intersection graphs (i.e. intersection graphs of unit disks) is NP-hard. That proof is easily modified to apply to unit disk touching graphs as well. In this paper, we show how to generalize our earlier construct