home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.graphics
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!uwm.edu!spool.mu.edu!yale.edu!ira.uka.de!fauern!rz.uni-passau.de!kirk.fmi.uni-passau.de!dux
- From: dux@kirk.fmi.uni-passau.de (Frank Dux)
- Subject: need implementation of planarity testing alg.
- Message-ID: <1992Dec14.120657.4653@tom.rz.uni-passau.de>
- Summary: need implementation of the planarity-testing algorithm by lempel,even,cederbaum, improvbed by booth & lueker
- Keywords: graph,planarity,booth,lueker,pq-tree,lempel,even,cederbaum
- Sender: news@tom.rz.uni-passau.de (News-Operator)
- Organization: University of Passau, Germany
- Date: Mon, 14 Dec 1992 12:06:57 GMT
- Lines: 14
-
- Hi folks!
- Don't know if this is the right group for my question, but I'll try it anyway...
- I'm currently working with a planarity testing algorithm for graphs, which
- was devised by Lempel,Even and Cederbaum.
- I'd like to see an implementation of this algorithm, if possible with
- PQ-trees (as suggested by Booth & Lueker).
- So if anyone has a full(!), working version of this algorithm on a common
- machine, please mail me (I don't follow this group regularly).
-
- Thanx a lot,
-
- Frank.
-
- P.S.: I'd also appreciate a version of the Hopcroft-Tarjan algorithm!
-