Fast algorithms for planar graphs, Part I: cycles and cuts

Letchford, Adam (2003) Fast algorithms for planar graphs, Part I: cycles and cuts. In: 18th International Symposium on Mathematical Programming (ISMP 2003), 2003-08-182003-08-22.

Full text not available from this repository.
Item Type:
Contribution to Conference (Paper)
Journal or Publication Title:
18th International Symposium on Mathematical Programming (ISMP 2003)
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
ID Code:
73531
Deposited By:
Deposited On:
18 Jun 2015 06:16
Refereed?:
Yes
Published?:
Published
Last Modified:
19 Mar 2020 01:54