RODE 发表于 2025-3-25 05:15:36
1.13 Errata and Addenda for Vol. 22a,lexity, and statistics..We investigate upper bounds on the product of the number of facets . and the number of vertices ., where . is the dimension of a 2-level polytope .. This question was first posed in [.], where experimental results showed . up to ...We show that this bound holds for all knownALERT 发表于 2025-3-25 07:50:03
1.13 Errata and Addenda for Vol. 22a,t, determine a basis of minimum cost among those with . red elements, or decide that no such basis exists. In this paper, we investigate possible extensions of this result from ordinary matroids to the more general notion of .. Poset matroids (also called .) are defined on the collection of all ideaInsensate 发表于 2025-3-25 14:34:04
http://reply.papertrans.cn/23/2300/229955/229955_23.png憎恶 发表于 2025-3-25 17:14:22
http://reply.papertrans.cn/23/2300/229955/229955_24.pngdialect 发表于 2025-3-25 21:33:26
Combinatorial Optimization978-3-319-45587-7Series ISSN 0302-9743 Series E-ISSN 1611-3349四指套 发表于 2025-3-26 03:01:21
http://reply.papertrans.cn/23/2300/229955/229955_26.pngglucagon 发表于 2025-3-26 05:21:14
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions,ict the input graph . to some special graph class. We continue a line of research that considers these problems for subclasses of perfect graphs, but our main results are full classifications, from a computational complexity point of view, for graph classes characterized by forbidding a single induced connected subgraph ..ABYSS 发表于 2025-3-26 10:11:06
The Parity Hamiltonian Cycle Problem in Directed Graphs,on when a directed graph has a PHC, and shows that the PHC problem in a directed graph is solved in polynomial time. The characterization, unlike with the undirected case, is described by a linear system over GF(2).MAIM 发表于 2025-3-26 14:06:27
http://reply.papertrans.cn/23/2300/229955/229955_29.png容易生皱纹 发表于 2025-3-26 20:28:31
http://reply.papertrans.cn/23/2300/229955/229955_30.png