NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field

▾

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Complexity of Graph Modification Problems

Study of hardness and approximation for modifying graphs to achieve properties like planarity, chordality, or specific degeneracy bounds.