Entry Eades:1994:DGT from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Eades:1994:DGT,
author = "Peter Eades and Sue Whitesides",
title = "Drawing graphs in two layers",
journal = j-THEOR-COMP-SCI,
volume = "131",
number = "2",
pages = "361--374",
day = "12",
month = sep,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:23 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=131&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=131&issue=2&aid=1573",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C4260
(Computational geometry)",
corpsource = "Dept. of Comput. Sci., Newcastle Univ., Callaghan,
NSW, Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bipartite graph; biplanar; computational complexity;
computational geometry; edge set; graph theory;
NP-complete; polynomial time; straight line segments;
vertex set",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bipartite,
102(2)283,
106(2)309,
110(1)197,
112(2)371,
115(2)351,
123(2)329,
127(2)255
- C4260,
88(2)231,
92(2)319,
94(2)295,
98(2)263,
103(1)107,
106(2)265,
112(2)215,
112(2)339,
115(2)291,
115(2)351,
116(2)291,
116(2)359,
116(2)373,
117(1)153,
117(1)187,
117(1)203,
119(2)331,
123(1)151,
123(1)z,
127(1)187,
129(2)263,
129(2)369,
130(1)125,
130(1)139,
130(1)163,
134(2)415
- complete, NP-,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361,
120(2)311,
135(1)155
- drawing,
108(2)357,
119(2)331
- edge,
71(3)401,
74(3)299,
75(3)357,
84(2)179,
86(2)205,
102(2)283,
112(2)371,
112(2)419,
116(1)151,
127(2)395,
128(1)241
- geometry,
74(1)95,
74(3)253,
81(2)289,
84(1)77,
84(1)127,
86(2)205,
88(2)231,
92(2)319,
94(2)295,
98(2)263,
103(1)107,
106(2)265,
112(2)215,
112(2)339,
113(2)371,
115(2)291,
115(2)351,
116(2)291,
116(2)359,
116(2)373,
117(1)153,
117(1)187,
117(1)203,
119(2)331,
123(1)151,
123(1)z,
127(1)187,
129(2)263,
129(2)369,
130(1)125,
130(1)139,
130(1)163,
134(1)131,
134(2)415
- line,
71(3)381,
81(2)289,
108(2)357,
115(2)291,
115(2)321,
130(1)49
- NP-complete,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361
- segments,
115(2)291
- straight,
115(2)291
- two,
73(3)265,
74(3)329,
76(2)273,
79(1)241,
86(2)143,
92(1)77,
95(1)169,
95(2)323,
98(2)339,
100(1)105,
104(2)161,
112(2)311,
112(2)391,
120(2)197,
123(2)239,
127(1)187,
131(2)449,
134(2)415,
136(2)507
- vertex,
72(1)65,
74(1)19,
74(3)299,
84(2)179,
86(2)205,
90(2)355,
91(1)1,
97(2)285,
99(2)213,
103(1)107,
112(2)419,
115(2)351,
126(1)53,
130(1)175,
132(1)337,
134(1)209