Listing minimal edge-covers of intersecting families with applications to connectivity problems

Keyphrases

• Undirected Graph 100%
• Polynomial Time 100%
• Connection Problem 100%
• Intersecting Family 100%
• Minimal Edge Cover 100%
• K-connected 50%
• Edge Set 50%
• Steiner System 50%
• Edge Cover 50%
• Spanning Subgraph 50%
• Polynomial Delay 50%
• Minimal Member 50%

Computer Science

• Polynomial Time 100%
• Directed Graphs 100%
• Connectivity Problem 100%
• Subgraphs 50%

Mathematics

• Edge Cover 100%
• Edge 66%
• Polynomial Time 66%
• Polynomial 33%
• Residuals 33%