Inverse Matroid Intersection Problem

1997 ◽  
Vol 45 (2) ◽  
pp. 235-243 ◽  
Author(s):  
Cai Mao-Cheng ◽  
Yanjun Li
Keyword(s):  
Matroid Intersection ◽  
Intersection Problem ◽  
Matroid Intersection Problem

scholarly journals Strongly Possible Keys for SQL

2020 ◽  
Vol 9 (2-3) ◽  
pp. 85-99
Author(s):  
Munqath Alattar ◽  
Attila Sali
Keyword(s):  
Data Mining ◽  
Missing Values ◽  
Possible World ◽  
Bipartite Matching ◽  
Matroid Intersection ◽  
Intersection Problem ◽  
Data Mining Approach ◽  
Data Value ◽  
Two Measures ◽  
Matroid Intersection Problem

Abstract Missing data value is an extensive problem in both research and industrial developers. Two general approaches are there to deal with the problem of missing values in databases; they could be either ignored (removed) or imputed (filled in) with new values (Farhangfar et al. in IEEE Trans Syst Man Cybern-Part A: Syst Hum 37(5):692–709, 2007). For some SQL tables, it is possible that some candidate key of the table is not null-free and this needs to be handled. Possible keys and certain keys to deal with this situation were introduced in Köhler et al. (VLDB J 25(4):571–596, 2016). In the present paper, we introduce an intermediate concept called strongly possible keys that is based on a data mining approach using only information already contained in the SQL table. A strongly possible key is a key that holds for some possible world which is obtained by replacing any occurrences of nulls with some values already appearing in the corresponding attributes. Implication among strongly possible keys is characterized, and Armstrong tables are constructed. An algorithm to verify a strongly possible key is given applying bipartite matching. Connection between matroid intersection problem and system of strongly possible keys is established. For the cases when no strongly possible keys hold, an approximation notion is introduced to calculate the closeness of any given set of attributes to be considered as a strongly possible key using the $$g_3$$ g 3 measure, and we derive its component version $$g_4$$ g 4 . Analytical comparisons are given between the two measures.

scholarly journals Parity Systems and the Delta-Matroid Intersection Problem

10.37236/1492 ◽  
1999 ◽  
Vol 7 (1) ◽  
Author(s):  
André Bouchet ◽  
Bill Jackson
Keyword(s):  
Abstract System ◽  
Matroid Intersection ◽  
Intersection Problem ◽  
Common Base ◽  
Carry Over ◽  
Matroid Intersection Problem

We consider the problem of determining when two delta-matroids on the same ground-set have a common base. Our approach is to adapt the theory of matchings in 2-polymatroids developed by Lovász $[13]$ to a new abstract system, which we call a parity system. Examples of parity systems may be obtained by combining either, two delta-matroids, or two orthogonal 2-polymatroids, on the same ground-sets. We show that many of the results of Lovász concerning 'double flowers' and 'projections' carry over to parity systems.

scholarly journals On resolvability of a graph associated to a finite vector space

2019 ◽  
Vol 18 (02) ◽  
pp. 1950029
Author(s):  
U. Ali ◽  
S. A. Bokhary ◽  
K. Wahid ◽  
G. Abbas
Keyword(s):  
Vector Space ◽  
Domination Number ◽  
Exchange Property ◽  
Metric Dimension ◽  
Resolving Set ◽  
Matroid Intersection ◽  
Finite Vector ◽  
Finite Vector Space ◽  
Partition Dimension ◽  
Matroid Intersection Problem

In this paper, the resolving parameters such as metric dimension and partition dimension for the nonzero component graph, associated to a finite vector space, are discussed. The exact values of these parameters are determined. It is derived that the notions of metric dimension and locating-domination number coincide in the graph. Independent sets, introduced by Boutin [Determining sets, resolving set, and the exchange property, Graphs Combin. 25 (2009) 789–806], are studied in the graph. It is shown that the exchange property holds in the graph for minimal resolving sets with some exceptions. Consequently, a minimal resolving set of the graph is a basis for a matroid with the set [Formula: see text] of nonzero vectors of the vector space as the ground set. The matroid intersection problem for two matroids with [Formula: see text] as the ground set is also solved.

Parallel algorithms for matroid intersection and matroid parity

2015 ◽  
Vol 07 (02) ◽  
pp. 1550019
Author(s):  
Jinyu Huang
Keyword(s):  
Parallel Algorithms ◽  
Polynomial Identity ◽  
Black Box ◽  
Matroid Intersection ◽  
Polynomial Identity Testing ◽  
Identity Testing ◽  
Common Base ◽  
Graphic Matroid ◽  
Matroid Parity ◽  
Nc Algorithms

A maximum linear matroid parity set is called a basic matroid parity set, if its size is the rank of the matroid. We show that determining the existence of a common base (basic matroid parity set) for linear matroid intersection (linear matroid parity) is in NC2, provided that there are polynomial number of common bases (basic matroid parity sets). For graphic matroids, we show that finding a common base for matroid intersection is in NC2, if the number of common bases is polynomial bounded. To our knowledge, these algorithms are the first deterministic NC algorithms for matroid intersection and matroid parity. We also give a new RNC2 algorithm that finds a common base for graphic matroid intersection. We prove that if there is a black-box NC algorithm for Polynomial Identity Testing (PIT), then there is an NC algorithm to determine the existence of a common base (basic matroid parity set) for linear matroid intersection (linear matroid parity).

Orthogonal Trades and the Intersection Problem for Orthogonal Arrays

2015 ◽  
Vol 32 (3) ◽  
pp. 903-912
Author(s):  
Fatih Demirkale ◽  
Diane M. Donovan ◽  
Selda Küçükçifçi ◽  
Emine Şule Yazıcı
Keyword(s):  
Orthogonal Arrays ◽  
Intersection Problem

Study on Stability for Intersection of Deep Soft Rock Roadway

2011 ◽  
Vol 243-249 ◽  
pp. 2666-2669
Author(s):  
Zhan Jin Li ◽  
Yang Zhang ◽  
Xue Li Zhao
Keyword(s):  
Coal Mine ◽  
Soft Rock ◽  
Intersection Problem ◽  
The Third ◽  
Geological Conditions ◽  
Control Stability ◽  
Soft Rock Roadway ◽  
Crossing Point ◽  
Coupling Support ◽  
Rock Roadway

With the depth increasing continuously, more complicated of geological conditions, will make intersection in deep soft rock roadway is very difficult to support. In order to solve the intersection problem of difficult to support, combined with the third levels of the Fifth Coal Mine of Hemei, the coupling supporting design—anchor-mesh-cable + truss to control stability of crossing point—is proposed. Based software of FLAC3D, simulate the program applicable in deep soft rock roadway intersection. Application results show that the coupling support technology of anchor-mesh-cable + truss can effectively control the deformation of intersection in deep soft rock roadway.

Matroid Intersection

2004 ◽  
pp. 84-106
Keyword(s):  
Matroid Intersection

A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision

2022 ◽  
pp. 1013-1035
Author(s):  
Sumanta Ghosh ◽  
Rohit Gurjar ◽  
Roshan Raj
Keyword(s):  
Matroid Intersection ◽  
Parallel Reduction
Sign in / Sign up

Export Citation Format

Share Document