decipher
发表于 2025-3-25 06:11:05
http://reply.papertrans.cn/25/2423/242207/242207_21.png
骚动
发表于 2025-3-25 11:09:28
http://reply.papertrans.cn/25/2423/242207/242207_22.png
rods366
发表于 2025-3-25 15:29:49
For a More Democratic Agonistic Politicsgorithmic results, we show that the problems of enumerating minimal connected vertex covers and minimal capacitated vertex covers in bipartite graphs are at least as hard as enumerating minimal transversals in hypergraphs.
实施生效
发表于 2025-3-25 17:39:29
http://reply.papertrans.cn/25/2423/242207/242207_24.png
衰弱的心
发表于 2025-3-25 22:09:10
http://reply.papertrans.cn/25/2423/242207/242207_25.png
多嘴
发表于 2025-3-26 01:47:19
http://reply.papertrans.cn/25/2423/242207/242207_26.png
轻弹
发表于 2025-3-26 04:39:59
,Hypergraph Dualization with ,-delay Parameterized by the Degeneracy and Dimension,bounds even for the particular case of minimal dominating sets enumeration. In this paper, using ordered generation, we show that an .-delay algorithm can be devised for minimal transversals enumeration parameterized by the degeneracy and dimension, giving a positive and more general answer to the latter question.
确定
发表于 2025-3-26 10:56:21
,Simple Random Sampling of Binary Forests with Fixed Number of Nodes and Trees,atalan numbers. Via some well-known bijections, the given algorithm can be used to sample random objects from several other classes enumerated by self-convolutions of the Catalan numbers, e.g., binary forests with given number of trees, lists of given number of balanced strings and others.
Forehead-Lift
发表于 2025-3-26 13:24:11
,Approximate Realizations for Outerplanaric Degree Sequences,econd inequality is a necessary condition for a sequence . with . to be outerplanaric.) We partition . into two disjoint subfamilies, ., such that every sequence in . is provably non-outerplanaric, and every sequence in . is given a realizing graph . enjoying a 2-page book embedding (and moreover, one of the pages is also bipartite).
Carminative
发表于 2025-3-26 19:04:26
Convex-Geometric ,-Planar Graphs Are Convex-Geometric ,-Quasiplanar,metric if its vertices are drawn as points on a circle and its edges are drawn as straight line segments between them. In this paper we prove that, for ., every convex-geometric .-planar graph is convex-geometric .-quasiplanar.