D. J. A. Welsh. Matroid Theory. Academic Press, London, 1976. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Efficient Algorithms for Robustness in Matroid Optimization - Greg Frederickson Roberto (1996) (Correct)
.... been used to compute the robustness function for minimum spanning trees [11] shortest paths [12] and to approximate the robustness function for maximum flows in planar graphs [28] Matroid theory provides an elegant structure that captures the essence of a large and important class of problems [23, 24, 29, 32]. There are matroid optimization problems in computational biology [17] graph theory [11, 23] and electrical networks [24, 29] for which only estimates of the input values are available, or for which changes in the input values are expected. The robustness functions for these problems can be ....
....the time bound stated above. For transversal matroids, we give an algorithm that computes the robustness function in =jEj 2) time, where E is the set of edges in the bipartite graph that defines the transversal matroid (see e.g. 13] We prove an extension of Hall s Theorem (see e.g. [32]) for minors of transversal matroids, which allows us to solve the membership problem on their matroid polyhedra by performing one min cut computation over a bipartite graph. Scheduling matroids are a special case of transversal matroids (see e.g. 13] We show how to compute the robustness ....
[Article contains additional citation context not shown here]
D.J.A. Welsh, Matroid Theory, Academic Press, London 1976. 41
Application of Linear Matroids to Graph Colorability - Jensen (2001) (Correct)
....that G cannot be 3 colored. 2 3 Terminology and notation For the purpose of making the presentation as self contained as possible, this section contains a number of standard de nitions mainly from the area of matroid theory. For more thorough introductions to this topic, one may consult [8, 10, 11]. The nite q element eld is denoted by F q , and the n dimensional vector space F n by W n , n 0. In the following, all scalars and entries of vectors and matrices belong to F q , unless explicitly stated otherwise. Unless otherwise speci ed, vectors of dimension n are n 1 matrices ....
....connected if M has precisely one component. The rank of M , denoted by r(M ) is the largest cardinality of any member of I; this is of course precisely the rank of A. The empty matroid is the matroid ( f;g) represented by the empty matrix. In the general axiomatic setting of matroid theory, see [10, 11], there exist matroids which do not originate from matrices, that is, matroids that are not linear. We will not be concerned with the general setting here, and proceed to use the term matroid synonymously with linear matroid . M 1 = E 1 ; I 1 ) and M 2 = E 2 ; I 2 ) are isomorphic, M 1 M 2 ....
[Article contains additional citation context not shown here]
D.J.A. Welsh, Matroid Theory , Academic Press 1976. 42
On the Theory of Pfaffian Orientations. II. T-joins, k-Cuts, .. - Galluccio, Loebl (1998) (Correct)
No context found.
D. J. A. Welsh. Matroid Theory. Academic Press, London, 1976.
Ascending And Descending Conditional Independence Relations - Matus (1992) (Correct)
No context found.
Welsh D. J. A. (1976) : Matroid Theory. Academic Press, London.
Towards Classification of Semigraphoids - Matus (2004) (Correct)
No context found.
D.J.A. Welsh (1976) Matroid Theory. Academic Press, London.
Ideal Multipartite Secret Sharing Schemes - Oriol Farras Jaume (2006) (Correct)
No context found.
D.J.A. Welsh. Matroid Theory . Academic Press, London, 1976. 20
Int. J. General Systems - Vol Probabilistic Conditional (Correct)
No context found.
Welsh, D.J.A. (1976) Matroid Theory. Academic Press: London.
Matroid Representations by Partitions - Matus (1995) (4 citations) (Correct)
No context found.
D.J.A. Welsh (1976) Matroid Theory. Academic Press, London.
Conditional Independences among Four Random Variables II - Matus (1995) (Correct)
No context found.
WELSH, D.J.A. (1976). Matroid Theory. Academic Press, London.
Stochastic independence, algebraic independence and abstract.. - Matus (1994) (Correct)
No context found.
D.J.A. Welsh, Matroid Theory (Academic Press, London, New York, San Francisco, 1976).
On the Cocircuit Graph of an Oriented Matroid - Cordovil, Fukuda, de Oliveira (2000) (Correct)
No context found.
Welsh, D. J. A.: Matroid Theory, L. M.S. Monographs, No. 8, Academic Press/Harcourt Brace Jovanovich, London/New York, 1976.
On Secret Sharing Schemes, Matroids and Polymatroids - Jaume Mart-Farre And (2006) (Correct)
No context found.
D.J.A. Welsh. Matroid Theory . Academic Press, London, 1976. 14
On the Fairest Corner Point of the MIMO-BC Capacity Region - Maddah-Ali, Mobasher.. (Correct)
No context found.
D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976.
Cycle index, weight enumerator, and Tutte polynomial - Cameron (2002) (Correct)
No context found.
D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976.
Approximations for the Disjoint Paths Problem in.. - Kleinberg, Tardos (1995) (28 citations) (Correct)
No context found.
D.J.A. Welsh, Matroid Theory, London: Academic Press, 1976. 23
Building Trees, Hunting for Trees, and Comparing Trees - Theory.. - Bryant (1997) (4 citations) (Correct)
No context found.
D.J.A. Welsh. Matroid Theory. Academic Press, London, 1976.
Approximation Algorithms for Disjoint Paths Problems - Kleinberg (1996) (62 citations) (Correct)
No context found.
D.J.A. Welsh, Matroid Theory, London: Academic Press, 1976. 188
MacWilliams identities and matroid polynomials - Britz (2002) (2 citations) (Correct)
No context found.
D. J. A. Welsh, Matroid Theory, Academic Press, London-New York, 1976.
Cycle index, weight enumerator, and Tutte polynomial - Cameron (2002) (Correct)
No context found.
D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976.
Online Ascending Auctions for Gradually Expiring Items - Lavi, Nisan (2004) (2 citations) (Correct)
No context found.
Dominic J. A. Welsh. Matroid theory. London : Academic Press, 1976.
MacWilliams identities and matroid polynomials - Britz (2002) (2 citations) (Correct)
No context found.
D. J. A. Welsh, Matroid Theory, Academic Press, London-New York, 1976.
Online Ascending Auctions for Gradually Expiring Items - Lavi, Nisan (2004) (2 citations) (Correct)
No context found.
Dominic J. A. Welsh. Matroid theory. London : Academic Press, 1976.
Unknown - (Correct)
No context found.
Welsh, D.: Matroid Theory, Academic Press, 1976.
Annals of Combinatorics 1 (1997) 135-158 Annals of - Combinatorics.. (Correct)
No context found.
D.J.A. Welsh, Matroid Theory, Academic Press, London, 1976.
Polynomial Aspects of Codes, Matroids and Permutation Groups - Cameron (Correct)
No context found.
D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC