群居动物
发表于 2025-3-30 11:13:35
https://doi.org/10.1007/978-3-658-04031-4ure quality in terms of keeping adjacent regions close (cartogram quality) and using similar positions for a region between the different data values (stability). Our method guarantees ability to connect most lost adjacencies with minimal leaders. Experiments show our method yields good quality and stability.
Myofibrils
发表于 2025-3-30 15:40:02
http://reply.papertrans.cn/39/3880/387922/387922_52.png
朴素
发表于 2025-3-30 19:21:54
Sara Fürstenau,Mechtild Gomollaval graphs. Further, we extend earlier results about special bipartite graph classes to the notion of strict outerconfluency, show that SOC graphs have cop number two, and establish that tree-like (.-)SOC graphs have bounded cliquewidth.
使习惯于
发表于 2025-3-30 23:57:16
http://reply.papertrans.cn/39/3880/387922/387922_54.png
modish
发表于 2025-3-31 04:31:33
Computing Stable Demers Cartogramsure quality in terms of keeping adjacent regions close (cartogram quality) and using similar positions for a region between the different data values (stability). Our method guarantees ability to connect most lost adjacencies with minimal leaders. Experiments show our method yields good quality and stability.
拾落穗
发表于 2025-3-31 07:49:25
http://reply.papertrans.cn/39/3880/387922/387922_56.png
outskirts
发表于 2025-3-31 12:31:05
On Strict (Outer-)Confluent Graphsval graphs. Further, we extend earlier results about special bipartite graph classes to the notion of strict outerconfluency, show that SOC graphs have cop number two, and establish that tree-like (.-)SOC graphs have bounded cliquewidth.
破裂
发表于 2025-3-31 15:49:52
Bundled Crossings Revisitedinimization: A graph is given and the goal is to find a bundled drawing with at most . bundled crossings. We show that the problem is NP-hard when we require a simple drawing. Our main result is an FPT algorithm (in .) when we require a simple circular layout. These results make use of the connection between bundled crossings and graph genus.