Titlebook: Combinatorial Algorithms; 35th International W Adele Anna Rescigno,Ugo Vaccaro Conference proceedings 2024 The Editor(s) (if applicable) an

decipher

騷動(dòng)

rods366

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.

實(shí)施生效

衰弱的心

多嘴

輕彈

,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.

確定

,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

,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

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.