In graph theory, the Dulmage–Mendelsohn decomposition is a partition of the vertices of a bipartite graph into subsets, with the property that two… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

Although victimology as a field is in its infancy and is undergoing definition, several theories of victimization that have… (More)

Is this relevant?

2012

2012

In this paper we present an efficient algorithm for computing a sparse null space basis for a full row rank matrix. We first… (More)

Is this relevant?

2009

2009

- V. de Flaugergues, Manuella Bayart, Marco Pengov
- 2009

Structural analysis is a simple but efficient method in the field of Fault Detection and Isolation (FDI), to determine system… (More)

Is this relevant?

2006

2006

- Frank E. Bennett
- 2006

The basic necessary conditions for the existence of a (v, k, λ)-perfect Mendelsohn design (briefly (v, k, λ)-PMD) are v ≥ k and… (More)

Is this relevant?

2006

2006

- Zhenfu Cao, Gennian Ge, Ying Miao
- Des. Codes Cryptography
- 2006

Combinatorial characterizations of one-coincidence frequency-hopping (FH) sequences are provided in terms of perfect Mendelsohn… (More)

Is this relevant?

2002

2002

- Betsy Mendelsohn
- 2002

On my honor as a University student, on this assignment I have neither given nor received unauthorized aid as defined by the… (More)

Is this relevant?

1999

1999

- Vered Argaman
- 1999

In language comprehension, the in uence of the frequency of various elements has long been recognized, with more frequent… (More)

Is this relevant?

1998

1998

Applications of the Dulmage-mendelsohn Decomposition and Network Flow to Graph Bisection Improvement

In this paper, we consider the use of the Dulmage-Mendelsohn decomposition and network ow on bipartite graphs to improve a graph… (More)

Is this relevant?

1993

1988

1988

- Luc Teirlinck, C. C. Lindner
- Eur. J. Comb.
- 1988

The maximum number of idempotent quasigroups of order n which pairwise agree on the main diagonal only is n 2. Such a collection… (More)

Is this relevant?