Pages that link to "Item:Q5311106"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311106):
Displaying 7 items.
- Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (Q867855) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Listing minimal edge-covers of intersecting families with applications to connectivity problems (Q1003760) (← links)
- On enumerating minimal dicuts and strongly connected subgraphs (Q2471808) (← links)
- Disconnecting sets in single and two-terminal-pair networks (Q4887740) (← links)
- Integer Programming and Combinatorial Optimization (Q5712450) (← links)