On the Number of Edges of Fan-Crossing Free Graphs
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Cheong, Otfried | ko |
| dc.contributor.author | Har-Peled, Sariel | ko |
| dc.contributor.author | Kim, Heuna | ko |
| dc.contributor.author | Kim, Hyo-Sil | ko |
| dc.date.accessioned | 2016-04-20T06:49:07Z | - |
| dc.date.available | 2016-04-20T06:49:07Z | - |
| dc.date.created | 2016-01-04 | - |
| dc.date.created | 2016-01-04 | - |
| dc.date.created | 2016-01-04 | - |
| dc.date.issued | 2015-12 | - |
| dc.identifier.citation | ALGORITHMICA, v.73, no.4, pp.673 - 695 | - |
| dc.identifier.issn | 0178-4617 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/205502 | - |
| dc.description.abstract | A graph drawn in the plane with vertices is -fan-crossing free for if there are no edges , such that have a common endpoint and crosses all . We prove a tight bound of on the maximum number of edges of a -fan-crossing free graph, and a tight bound for a straight-edge drawing. For , we prove an upper bound of edges. We also discuss generalizations to monotone graph properties. | - |
| dc.language | English | - |
| dc.publisher | SPRINGER | - |
| dc.subject | QUASI-PLANAR GRAPHS | - |
| dc.title | On the Number of Edges of Fan-Crossing Free Graphs | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000366155100005 | - |
| dc.identifier.scopusid | 2-s2.0-85027920419 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 73 | - |
| dc.citation.issue | 4 | - |
| dc.citation.beginningpage | 673 | - |
| dc.citation.endingpage | 695 | - |
| dc.citation.publicationname | ALGORITHMICA | - |
| dc.identifier.doi | 10.1007/s00453-014-9935-z | - |
| dc.contributor.localauthor | Cheong, Otfried | - |
| dc.contributor.nonIdAuthor | Har-Peled, Sariel | - |
| dc.contributor.nonIdAuthor | Kim, Heuna | - |
| dc.contributor.nonIdAuthor | Kim, Hyo-Sil | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | Graph drawing | - |
| dc.subject.keywordAuthor | K-planar graphs | - |
| dc.subject.keywordAuthor | Crossing number | - |
| dc.subject.keywordPlus | QUASI-PLANAR GRAPHS | - |
- Appears in Collection
- CS-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 17 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.