Entry Megiddo:1988:FMD from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Megiddo:1988:FMD,
author = "Nimrod Megiddo and Uzi Vishkin",
title = "On finding a minimum dominating set in a tournament",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "307--316",
month = nov,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "IBM",
affiliationaddress = "San Jose, CA, USA",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "IBM Almaden Res. Center, San Jose, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; Boolean Formulas; boolean formulas;
Computer Programming; conjunctive normal form; directed
graph; directed graphs; Mathematical Techniques--Set
Theory; Minimum Dominating Set; minimum dominating set;
polynomial-time algorithm; Polynomial-Time Algorithm;
polynomial-time algorithm; Satisfiability Problem;
satisfiability problem; tournament; Tournament",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- B0250,
36(2)319,
38(1)123,
38(2)249,
38(2)293,
38(2)343,
40(2)329,
41(2)141,
41(2)185,
41(2)325,
43(1)99,
45(3)261,
48(1)95,
53(2)201,
53(2)281,
54(2)181,
54(2)215,
54(2)237,
54(2)341,
55(1)87,
56(2)223,
56(2)233,
57(1)153,
58(1)103,
58(1)209,
58(1)325,
61(2)175,
61(2)317,
64(1)25,
64(1)67,
64(1)97,
64(1)119,
65(2)149,
65(2)153,
68(1)89
- boolean,
35(2)313,
36(1)59,
36(1)119,
36(2)239,
36(2)291,
36(2)333,
38(1)55,
38(1)133,
38(2)343,
40(2)275,
43(1)43,
43(2)201,
44(2)127,
44(3)247,
47(1)61,
47(3)237,
48(1)53,
49(1)1,
51(1)53,
52(1)59,
52(3)239,
53(2)267,
54(1)65,
55(2)291,
56(3)345,
57(1)97,
57(1)113,
59(1)85,
64(3)271,
64(3)331,
66(1)15,
66(1)113,
68(1)19
- directed,
39(2)155,
40(2)149,
41(2)141,
41(2)185,
43(1)99,
44(3)275,
44(3)307,
45(3)261,
47(2)205,
47(3)315,
48(2)273,
52(1)37,
52(1)155,
55(1)87,
56(2)223,
58(1)325,
60(1)1,
61(2)175,
63(2)223,
64(2)191
- dominating,
53(2)257
- finding,
35(1)55,
36(2)265,
64(1)119
- form,
39(1)69,
39(2)297,
40(2)315,
41(1)113,
44(2)229,
44(3)259,
47(3)299,
54(1)65,
54(2)215,
54(2)299,
60(2)177,
61(2)299,
62(1)67,
64(2)203,
65(1)1,
66(3)323,
67(2)173,
68(2)135,
68(3)277
- formula,
38(2)307,
38(2)343,
39(2)155,
41(2)271,
46(1)91,
49(1)1,
52(3)281,
54(2)165,
57(1)97,
58(1)347,
59(1)115,
62(3)311,
65(2)153,
66(1)113,
68(1)113,
68(2)123
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- minimum,
47(3)237,
58(1)379,
60(3)231,
63(1)91,
66(2)181
- normal,
39(2)297,
40(2)315,
44(2)229,
44(3)259,
53(1)99,
60(2)177,
62(1)67,
66(3)323,
67(2)173,
68(3)277
- polynomial-time,
47(2)131,
47(3)263,
51(3)265,
52(1)77,
56(3)289,
68(3)267,
68(3)319
- satisfiability,
38(2)343,
40(2)195,
52(1)145,
67(2)303,
68(1)113,
68(2)123
- Set, Techniques-,
60(3)297,
62(1)221,
62(3)235,
63(1)43,
63(1)63,
63(3)239
- Techniques--Set,
60(3)297,
62(1)221,
62(3)235,
63(1)43,
63(1)63,
63(3)239
- time, polynomial-,
47(2)131,
47(3)263,
51(3)265,
52(1)77,
56(3)289,
68(3)267,
68(3)319
- tournament,
43(1)43,
67(1)5
- Vishkin, Uzi,
60(3)231