Back to Results
First PageMeta Content
Planar graphs / Network theory / Directed acyclic graph / Graph coloring / Shortest path problem / Hypercube graph / Planarity testing / Hamiltonian path / Tree / Graph theory / Theoretical computer science / NP-complete problems


Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem
Add to Reading List

Document Date: 2011-06-03 17:31:15

Open Document

File Size: 173,13 KB

Share Result on Facebook

Country

India / /

/

Facility

Prajakta Nimbhorkar The Institute of Mathematical Sciences / /

IndustryTerm

unambigous log-space algorithm / computing / above algorithm / search version / deterministic linear time algorithm / /

Organization

Ku Klux Klan / Institute of Mathematical Sciences / NL PPP / /

Person

Meena Mahajan / /

ProvinceOrState

New Foundland and Labrador / /

Technology

7 Algorithm / deterministic linear time algorithm / 16 The algorithm / embedding algorithm / DAGs Our algorithm / unambigous log-space algorithm / 8 Algorithm / /

SocialTag