Results 11 to 20 of about 3,681 (231)
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.
Jayme L Szwarcfiter
exaly +4 more sources
Lexicographic Partial Order [PDF]
Transactions of the American Mathematical Society, 1978 Given a (partially) ordered set P with the descending chain condition, and an ordered set Q , the set
Henry Crapo
openaire +2 more sources
Lagrangian Duality for Multiobjective Programming Problems in Lexicographic Order [PDF]
Abstract and Applied Analysis, 2013 This paper deals with a constraint multiobjective programming problem and its dual problem in the lexicographic order. We establish some duality theorems and present several existence results of a Lagrange multiplier and a lexicographic saddle point ...
X. F. Hu, L. N. Wang
doaj +2 more sources
Heliyon, 2023 The assembly line balancing problem (ALBP) is an eminent NP-hard topic that is discussed in mass production systems with low diversity. Primarily, two types of ALBPs are discussed in the literature as type I, which aims to find the minimum number of ...
Shifu Xu +4 more
doaj +2 more sources
On Optimizing Neutrosophic Complex Programming Using Lexicographic Order [PDF]
Neutrosophic Sets and Systems, 2020 Neutrosophic sets are considered as a generalization of the crisp set, fuzzy set, and intuitionistic fuzzy set for representing the uncertainty, inconsistency, and incomplete knowledge about the real world problems.
Hamiden Abd El- Wahed Khalifaand +2 more
doaj +3 more sources
Unranking Small Combinations of a Large Set in Co-Lexicographic Order
Algorithms, 2022 The presented research is devoted to the problem of developing new combinatorial generation algorithms for combinations. In this paper, we develop a modification of Ruskey’s algorithm for unranking m-combinations of an n-set in co-lexicographic order ...
Vladimir Kruchinin +3 more
doaj +3 more sources
Order Ideals on Lexicographic Direct Sum of Three Totally Ordered Abelian Groups
Cauchy: Jurnal Matematika Murni dan AplikasiOrder ideals play an important role in the study of abstract algebra, especially in the study of ordered groups. In this paper, we focus on the study of order ideals in lexicographic direct sums of totally ordered Abelian groups.
Dian Latifah +3 more
doaj +2 more sources
Lexicographic Orders of Intuitionistic Fuzzy Values and Their Relationships
Mathematics, 2019 Intuitionistic fuzzy multiple attribute decision making deals with the issue of ranking alternatives based on the decision information quantified in terms of intuitionistic fuzzy values. Lexicographic orders can serve as efficient and indispensable tools
Feng Feng +4 more
doaj +3 more sources
Finely homogeneous computations in free Lie algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 We first give a fast algorithm to compute the maximal Lyndon word (with respect to lexicographic order) of \textitLy_α (A) for every given multidegree alpha in \textbfN^k.
Philippe Andary
doaj +3 more sources
The existence of a triangle when its three elements are known
Lietuvos Matematikos Rinkinys, 2022 The problem of the existence of a triangle with respect to three given elements in some cases can be very difficult. For example, Brokard's problem about the existence of a triangle, given its three bisectors [1], has a long history [3] and solved only ...
Edmundas Mazėtis +1 more
doaj +1 more source