The following pages link to Bogdán Zaválnij (Q326945):
Displayed 15 items.
- Reducing graph coloring to clique search (Q326946) (← links)
- Coloring the nodes of a directed graph (Q399510) (← links)
- (Q1744247) (redirect page) (← links)
- Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248) (← links)
- (Q1927696) (redirect page) (← links)
- Greedy algorithms for triangle free coloring (Q1927697) (← links)
- Numerical experiments with LP formulations of the maximum clique problem (Q2103941) (← links)
- Coloring the edges of a directed graph (Q2353348) (← links)
- Reducing hypergraph coloring to clique search (Q2422750) (← links)
- Edge coloring of graphs, uses, limitation, complexity (Q2629566) (← links)
- Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method (Q3304782) (← links)
- Some Zero-One Linear Programming Reformulations for the Maximum Clique Problem (Q4997639) (← links)
- Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations (Q5147534) (← links)
- (Q5155414) (← links)
- (Q5165142) (← links)