Results 71 to 80 of about 215,248 (216)
Generating permutations and combinations in lexicographical order [PDF]
Journal of the Brazilian Computer Society, 2001 We consider producing permutations and combinations in lexicographical order. Except for the array that holds the combinatorial object, we require only O(1) extra storage. The production of the next item requires O(1) amortized time.
openaire +4 more sources
GROUP SO(4,2) AND SYMMETRY PROPERTIES OF D.I. MENDELEEV'S PERIODIC SYSTEM ELEMENTS
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019 The group-based method of classification of chemical elements for definition of their place in the Mendeleev’s periodic system of elements is considered.
A. L. Gurskii, L. I. Hurski
doaj
Two Self‐Stabilizing Algorithms for the Maximal Pentagon Partitioning Problem
Concurrency and Computation: Practice and Experience, Volume 38, Issue 19, October 2026.ABSTRACT Given an undirected graph G=(V,E)$$ G=\left(V,E\right) $$, a collection of disjoint subsets of nodes π={V1,…,Vk}(V=V1∪⋯∪Vk)$$ \pi =\left\{{V}_1,\dots, {V}_k\right\}\kern0.3em \left(V={V}_1\cup \cdots \cup {V}_k\right) $$ is called a pentagon partition if each subset Vi(1≤i≤k)$$ {V}_i\kern0.3em \left(1\le i\le k\right) $$ satisfies one of the ...
Tota Yamada +2 more
wiley +1 more source
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science, 2005 A complete bipartite set \(B\) of a graph is a subset of vertices admitting a bipartition \(B=X\cup Y\) such that both \(X\) and \(Y\) are independent sets and all vertices of \(X\) are adjacent to those of \(Y\). If both \(X,Y\neq \emptyset\), then \(B\) is called proper. A biclique is a maximal proper complete bipartite set of a graph.
Vânia M. Félix Dias +2 more
openaire +3 more sources
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, Volume 113, Issue 2, Page 252-273, October 2026.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w )
wiley +1 more source
On the lexicographic ordered spaces
Topology and its Applications, 2017 Abstract In this paper, we discuss the lexicographic ordered topologies on some products. We mainly prove: (1) The lexicographic ordered space λ γ is base-normal for any ordinals λ and γ. (2) The lexicographic ordered space [ 0 , 1 ) γ is Lindelof for each ordinal γ ≤ ω 1 .
openaire +1 more source
ADAPTIVE REORDERING OF OBSERVATION SPACE TO IMPROVE PATTERN RECOGNITION
TASK Quarterly, 2007 The problem of observation space reordering is presented as a novel approach to pattern recognition based on non-parametric, combinatorial statistical tests. It consists in linearly ordering the elements of a discrete multi-dimensional observation space
JULIUSZ L. KULIKOWSKI
doaj
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, Volume 113, Issue 2, Page 169-194, October 2026.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
The measurement of opportunity inequality: a cardinality-based approach [PDF]
, 1995 We consider the problem of ranking distributions of opportunity sets on the basis of equality. First, conditional on agents' preferences over individual opportunity sets, we formulate the analogues ofthe notions ofthe Lorenz partial ordering, equalizing ...
Ok, Efe A., Kranich, Laurence
core +1 more source
The first-order theory of lexicographic path orderings is undecidable
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Comon, Hubert, Treinen, Ralf
openaire +2 more sources