Finding a Maximum Cut of a Planar Graph in Polynomial Time 论文

1975SIAM Journal on Computing引用 395
DOI
Advanced Graph Theory ResearchComplexity and Algorithms in GraphsOptimization and Search Problems
Optimization and Search ProblemsAdvanced Graph Theory ResearchComplexity and Algorithms in Graphs
相关技术:Optimization and Search ProblemsComplexity and Algorithms in Graphs
关系图谱

Finding a Maximum Cut of a Planar Graph in Polynomial Time · 作者

F

Frank Hadlock