Algorithms for Graphs Embeddable with Few Crossings per Edge

Public

Algorithms for Graphs Embeddable with Few Crossings per Edge

N

Shared by NobleBlocks on Aug 1, 2007 • 12:00 AM UTC

Authors:

Alexander Grigoriev

,

Hans L. Bodlaender

Subject

Bounded function

Research Assistant

AI chat, annotations, notes & similar papers

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!

Publication Date: Aug 1, 2007 • 12:00 AM UTC

NobleID:w1/20260526/A3CD44DB

DOI:10.1007/s00453-007-0010-x

No figures available

Scan for Errors

Scan for EDDII

Summarise

Generate Podcast

Algorithms for Graphs Embeddable with Few Crossings per Edge | NobleBlocks