Entry Moran:1991:OCC 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{Moran:1991:OCC,
author = "S. Moran and Y. Wolfstahl",
title = "Optimal covering of cacti by vertex-disjoint paths",
journal = j-THEOR-COMP-SCI,
volume = "84",
number = "2",
pages = "179--197",
day = "29",
month = jul,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Fac. of Comput. Sci., Technion, Israel Inst. of
Technol., Haifa, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cacti; code optimization; computational complexity;
cubic 3-connected planar graphs; cycle; edge; graph
covering; graph theory; NP-complete; optimal covering
algorithm; parallel architectures; parallel programs;
path cover; smallest possible cardinality;
vertex-disjoint paths; vertices",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- architecture,
71(1)47,
76(2)331,
100(1)223,
116(2)317,
120(2)215,
125(1)61,
128(1)127,
128(1)241,
130(1)85,
132(1)377
- cardinality,
74(2)227,
76(2)261,
85(1)75,
92(1)19,
124(2)221,
125(2)361
- code,
71(2)177,
72(1)55,
73(2)177,
74(3)341,
80(1)105,
81(2)289,
83(2)301,
84(1)53,
84(2)265,
86(2)365,
88(1)83,
90(1)17,
92(1)145,
92(1)213,
94(2)215,
94(2)295,
96(2)325,
102(2)253,
108(1)119,
108(1)173,
108(1)z,
108(2)251,
117(1)255,
125(2)259,
129(2)407,
132(1)291,
134(1)3,
134(1)63,
134(1)107,
134(1)175,
134(1)189,
134(1)z,
136(2)471
- complete, NP-,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
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)361,
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
- cover,
86(2)377,
95(1)159,
115(2)351,
133(1)49
- cubic,
109(1)83,
120(2)197
- cycle,
71(3)419,
106(2)265,
117(1)3,
117(1)243,
119(2)331,
127(2)395,
131(2)463,
132(1)1
- edge,
71(3)401,
74(3)299,
75(3)357,
86(2)205,
102(2)283,
112(2)371,
112(2)419,
116(1)151,
127(2)395,
128(1)241,
131(2)361
- NP-complete,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
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)361,
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
- optimal,
71(3)401,
74(1)95,
74(2)183,
76(1)93,
76(2)331,
77(3)291,
80(1)105,
81(2)257,
82(1)113,
82(1)157,
84(1)127,
85(1)155,
86(2)365,
87(2)251,
92(1)33,
92(1)87,
92(1)z,
93(2)245,
106(2)361,
108(2)271,
111(1)191,
115(2)351,
119(2)355,
120(2)197,
120(2)261,
123(2)377,
125(1)91,
127(2)395,
128(1)179,
129(2)323,
130(1)17,
132(1)403,
134(2)263,
134(2)559
- optimization,
71(2)265,
76(1)143,
80(2)303,
81(2)317,
82(1)1,
84(1)77,
90(1)17,
90(1)61,
94(2)175,
97(1)105,
99(1)157,
104(2)285,
107(1)3,
107(1)145,
116(1)59,
118(2)231,
123(1)9,
125(1)17,
128(1)179,
134(2)493
- path,
72(2)251,
72(2)z,
74(2)199,
74(3)355,
79(1)151,
79(1)179,
83(2)189,
84(1)127,
84(2)281,
88(1)33,
88(1)151,
89(1)33,
94(1)141,
95(2)245,
100(1)243,
102(2)329,
105(1)129,
106(2)391,
112(2)255,
115(2)351,
116(2)359,
117(1)137,
117(1)187,
117(1)203,
125(2)345,
127(2)395,
131(1)1,
133(1)65
- planar,
70(2)251,
74(1)95,
74(3)299,
76(2)343,
85(2)253,
86(2)243,
88(1)183,
97(2)285,
99(2)213,
102(2)329,
112(2)215,
112(2)371,
112(2)419,
116(2)359,
117(1)45,
119(2)331,
123(1)151,
130(1)125,
130(1)139
- possible,
78(1)159,
84(2)225
- smallest,
92(1)119
- vertex,
72(1)65,
74(1)19,
74(3)299,
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,
131(2)361,
132(1)337,
134(1)209