诱导
发表于 2025-4-1 03:58:17
https://doi.org/10.1007/978-1-4684-2772-1It was known that every graph can be constructed from a finite list of elementary graphs using the operations of graph sum and graph composition. We determine a complete set of “equations” or rewriting rules with the property that two expressions represent the same graph if and only if one can be transformed into the other by means of these rules.
他很灵活
发表于 2025-4-1 09:41:28
http://reply.papertrans.cn/29/2812/281147/281147_62.png
情爱
发表于 2025-4-1 13:24:50
Metallurgy of Soldering and SolderabilityWe prove in this paper that there exists some infinitary rational relations which are Σ.-complete Borel sets and some others which are Π.-complete. These results give additional answers to questions of Simonnet [.] and of Lescow and Thomas [.,.].
vanquish
发表于 2025-4-1 17:18:05
Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A SurveyThe first paper on cellular automata in the hyperbolic plane appeared in [.], based on the technical report [.]. Later, several papers appeared in order to explore this new branch of computer science. Although applications are not yet seen, they may appear, especially in physics, in the theory of relativity or for cosmological researches.
conflate
发表于 2025-4-1 20:55:25
http://reply.papertrans.cn/29/2812/281147/281147_65.png
motor-unit
发表于 2025-4-1 23:03:29
ECO Method and the Exhaustive Generation of Convex PolyominoesECO is a method for the enumeration of classes of combinatorial objects based on recursive constructions of such classes. In this paper we use the ECO method and the concept of succession rule to develop an algorithm for the exhaustive generation of convex polyominoes. Then we prove that this algorithm runs in constant amortized time.
努力赶上
发表于 2025-4-2 03:53:26
http://reply.papertrans.cn/29/2812/281147/281147_67.png
消耗
发表于 2025-4-2 08:36:45
https://doi.org/10.1007/3-540-45066-1Automat; algorithms; automata; combinatorial optimization; complexity; computer; computer science; informat