Back to Results
First PageMeta Content
Eulerian path / Route inspection problem / Graph / Matching / Line graph / Hamiltonian path / Graph theory / Planar graphs / NP-complete problems


´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting:
Add to Reading List

Document Date: 2008-10-29 00:01:20

Open Document

File Size: 1,80 MB

Share Result on Facebook

City

Enschede / Montreal / Cambridge / /

Company

SIAM Journal / Vertex / Artificial Intelligence Laboratory / /

Country

Netherlands / United States / /

Currency

pence / /

/

Facility

Balloon HQ / Stony Brook University / /

IndustryTerm

classic polynomialtime solution / polynomial-time algorithm / potential applications / /

Organization

MIT / Stony Brook University / /

Person

Vladimir Tashkinov / Dorit Dor / Minli Yu / Naomi Greenfield / Alexandr Kostochka / Jiping Liu / Katherine Heinrich / Michael Tarsi / Sara Taksler / Robert Johansson / Erik D. Demaine∗ Martin / Ian Holyer / Martin L. Demaine∗ Vi Hart / /

ProvinceOrState

Quebec / Massachusetts / /

PublishedMedium

SIAM Journal on Computing / /

Technology

http / polynomial-time algorithm / /

URL

http /

SocialTag