unstable-angina
发表于 2025-3-28 17:19:01
http://reply.papertrans.cn/87/8603/860225/860225_41.png
Sinus-Node
发表于 2025-3-28 19:26:20
L-Drawings of Directed Graphseteness and provide a heuristic based on a polynomial-time algorithm that adds a vertex to a drawing using the minimum additional ink. We performed an experimental analysis of the heuristic which confirms its effectiveness.
overshadow
发表于 2025-3-29 01:53:39
http://reply.papertrans.cn/87/8603/860225/860225_43.png
整体
发表于 2025-3-29 04:20:46
978-3-662-49191-1Springer-Verlag Berlin Heidelberg 2016
SHRIK
发表于 2025-3-29 07:49:53
SOFSEM 2016: Theory and Practice of Computer Science978-3-662-49192-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
使虚弱
发表于 2025-3-29 15:24:06
http://reply.papertrans.cn/87/8603/860225/860225_46.png
黄瓜
发表于 2025-3-29 19:23:45
http://reply.papertrans.cn/87/8603/860225/860225_47.png
Prosaic
发表于 2025-3-29 20:58:06
Learning Automatic Families of LanguagesA class of languages is automatic if it is uniformly regular using some regular index set for the languages. In this survey we report on work about the learnability in the limit of automatic classes of languages, with some special emphasis to automatic learners.
insurgent
发表于 2025-3-30 03:54:25
On Contact Graphs with Cubes and Proportional BoxesWe study two variants of the problem of contact representation of planar graphs with axis-aligned boxes. In a . we realize each vertex with a cube, while in a . each vertex is an axis-aligned box with a prespecified volume. We show how to construct such representations representation for some classes of planar graphs.
gnarled
发表于 2025-3-30 04:53:24
http://reply.papertrans.cn/87/8603/860225/860225_50.png