ext_382446 (
combinator.livejournal.com
) wrote
in
dr4b
2005-07-13 05:15 am (UTC)
no subject
Best game ever.
I'm intrigued by the graph generation algorithm. Note: Detecting planarity, as well as "planarizing" a planar graph, can be done in polynomial time, though the algorithm is supposed to be quite complicated. See, e.g.
this paper
.
(
21 comments
)
Post a comment in response:
From:
Anonymous
This account has disabled anonymous posting.
OpenID
Identity URL:
Log in?
Dreamwidth account
Account name
Password
Log in?
If you don't have an account you can
create one now
.
Subject
HTML doesn't work in the subject.
Formatting type
Casual HTML
Markdown
Raw HTML
Rich Text Editor
Message
[
Home
|
Post Entry
|
Log in
|
Search
|
Browse Options
|
Site Map
]
no subject
I'm intrigued by the graph generation algorithm. Note: Detecting planarity, as well as "planarizing" a planar graph, can be done in polynomial time, though the algorithm is supposed to be quite complicated. See, e.g. this paper.