Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Iterated parallel union of matroids

From MaRDI portal
Publication:3767360
Jump to:navigation, search

DOI10.1007/BF02924901zbMATH Open0631.05016MaRDI QIDQ3767360FDOQ3767360


Authors: Tom Brylawski Edit this on Wikidata


Publication date: 1983

Published in: Rendiconti del Seminario Matematico e Fisico di Milano (Search for Journal in Brave)





Recommendations

  • Matroid Steiner problems, the Tutte polynomial and network reliability
  • Publication:3484842
  • scientific article; zbMATH DE number 3150
  • Reliable assignments of processors to tasks and factoring on matroids
  • Matroid union -- graphic? binary? neither?


zbMATH Keywords

starsrepresentabilityoperationreliability problemsTutte- polynomial


Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)


Cites Work

  • Title not available (Why is that?)
  • Matroid matching and some applications
  • Title not available (Why is that?)
  • Unlabelled Partition Systems: Optimization and Complexity


Cited In (2)

  • Matroid Steiner problems, the Tutte polynomial and network reliability
  • Unlabelled Partition Systems: Optimization and Complexity





This page was built for publication: Iterated parallel union of matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3767360)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3767360&oldid=17314260"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 12:24. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki