Complexity of partial covers of Theta graphs - PowerPoint PPT Presentation

1 / 91
} ?>
View by Category
About This Presentation
Title:

Complexity of partial covers of Theta graphs

Description:

NP-hardness reduction based on edge-precoloring-extension of bipartite graphs ... Given cubic bipartite graph G with some edges precolored by two colors, it is NP ... – PowerPoint PPT presentation

Number of Views:33
Avg rating:3.0/5.0
Slides: 92
Provided by: kamMf
Category:

less

Write a Comment
User Comments (0)
About PowerShow.com