Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Finding minimum generators of path systems

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

zbMath0938.05036MaRDI QIDQ1305531

András Frank

Publication date: 9 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)


zbMATH Keywords

path systems


Mathematics Subject Classification ID

Paths and cycles (05C38)


Related Items (4)

Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems ⋮ Jump Number of Two-Directional Orthogonal Ray Graphs ⋮ An algorithm to increase the node-connectivity of a digraph by one ⋮ Independent sets and hitting sets of bicolored rectangular families



Cites Work

  • Unnamed Item
  • Unnamed Item
  • A weighted min-max relation for intervals
  • Minimal edge-coverings of pairs of sets
  • An algorithm for covering polygons with rectangles
  • Irredundant intervals


This page was built for publication: Finding minimum generators of path systems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1305531&oldid=13414519"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 11:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki