-
2
-
-
85037918238
-
A tourist guide through treewidth
-
H.L. Bodlaender A tourist guide through treewidth Acta Cybernet. 11 1993 1 23
-
(1993)
Acta Cybernet.
, vol.11
, pp. 1-23
-
-
Bodlaender, H.L.1
-
3
-
-
0039942530
-
A partial k-arboretum of graphs with bounded treewidth
-
Department of Computer Science, Utrecht University
-
H.L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Tech. Report UU-CS-1996-02, Department of Computer Science, Utrecht University, 1996.
-
(1996)
Tech. Report UU-CS-1996-02
-
-
Bodlaender, H.L.1
-
5
-
-
0002074731
-
The recovery of trees from measures of dissimilarity
-
eds. F.R. Hodson, D.G. Kendall and P. Tautu, Edinburgh University Press, Edinburgh
-
P. Buneman, The recovery of trees from measures of dissimilarity, in: Mathematics in the Archaeological and Historical Sciences, eds. F.R. Hodson, D.G. Kendall and P. Tautu, Edinburgh University Press, Edinburgh, 1971, pp. 387-395.
-
(1971)
Mathematics in the Archaeological and Historical Sciences
, pp. 387-395
-
-
Buneman, P.1
-
6
-
-
49549154127
-
A characterization of rigid circuit graphs
-
P. Buneman A characterization of rigid circuit graphs Discrete Math. 9 1974 205 212
-
(1974)
Discrete Math.
, vol.9
, pp. 205-212
-
-
Buneman, P.1
-
7
-
-
0020119719
-
Polynomially bounded algorithms for locating p-centers on a tree
-
R. Chandrasekharan, and A. Tamir Polynomially bounded algorithms for locating p-centers on a tree Math. Programming 22 1982 304 315 (Pubitemid 12554655)
-
(1982)
Mathematical Programming
, vol.22
, Issue.3
, pp. 304-315
-
-
Chandrasekaran, R.1
Tamir, A.2
-
8
-
-
0037555041
-
Algorithmic aspects of domination in graphs
-
D.Z. Du, P.M. Pardalos (Eds.) Kluwer, Boston, MA
-
G.J. Chang, Algorithmic aspects of domination in graphs, in: D.Z. Du, P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization, Vol. 3, Kluwer, Boston, MA, 1998, pp. 339-405.
-
(1998)
Handbook of Combinatorial Optimization
, vol.3
, pp. 339-405
-
-
Chang, G.J.1
-
9
-
-
0012486130
-
Weighted independent perfect domination on cocomparability graphs
-
G.J. Chang, C. Pandu Rangan, and S.R. Coorg Weighted independent perfect domination on cocomparability graphs Discrete Appl. Math. 63 1995 215 222
-
(1995)
Discrete Appl. Math.
, vol.63
, pp. 215-222
-
-
Chang, G.J.1
Pandu Rangan, C.2
Coorg, S.R.3
-
10
-
-
0037536891
-
Weighted domination of cocomparability graphs
-
M.S. Chang Weighted domination of cocomparability graphs Discrete Appl. Math. 80 1997 135 148
-
(1997)
Discrete Appl. Math.
, vol.80
, pp. 135-148
-
-
Chang, M.S.1
-
11
-
-
0001368104
-
Topology of series-parallel networks
-
R.J. Duffin Topology of series-parallel networks J. Math. Anal. Appl. 10 1965 303 318
-
(1965)
J. Math. Anal. Appl.
, vol.10
, pp. 303-318
-
-
Duffin, R.J.1
-
12
-
-
0001780321
-
Planar 3DM is NP-complete
-
M.E. Dyer, and A.M. Frieze Planar 3DM is NP-complete J. Algorithms 7 1986 174 184
-
(1986)
J. Algorithms
, vol.7
, pp. 174-184
-
-
Dyer, M.E.1
Frieze, A.M.2
-
14
-
-
41549118299
-
The intersection graphs of subtrees in trees are exactly the chordal graphs
-
F. Gavril The intersection graphs of subtrees in trees are exactly the chordal graphs J. Combin. Theory, Ser. B 16 1974 47 56
-
(1974)
J. Combin. Theory, Ser. B
, vol.16
, pp. 47-56
-
-
Gavril, F.1
-
19
-
-
0003780715
-
-
Addison-Wesley Reading, MA
-
F. Harary Graph theory 1969 Addison-Wesley Reading, MA
-
(1969)
Graph Theory
-
-
Harary, F.1
-
20
-
-
0039384889
-
Linear time computability of combinatorial problems on generalized series-parallel graphs
-
eds. D. Johnson, T. Nishizeki, A. Nozaki and H. Wilf, Discrete Algorithms and Complexity, Academic Press, New York
-
E. Hare, S. Hedetniemi, R. Laskar, K. Peters, T. Wimer, Linear time computability of combinatorial problems on generalized series-parallel graphs, in: Proc. Japan-US Joint Seminar on Discrete Algorithms and Complexity, eds. D. Johnson, T. Nishizeki, A. Nozaki and H. Wilf, Discrete Algorithms and Complexity, Academic Press, New York, 1987, pp. 437-457.
-
(1987)
Proc. Japan-US Joint Seminar on Discrete Algorithms and Complexity
, pp. 437-457
-
-
Hare, E.1
Hedetniemi, S.2
Laskar, R.3
Peters, K.4
Wimer, T.5
-
25
-
-
0020719131
-
Linear algorithm for the domination number of a series-parallel graph
-
DOI 10.1016/0166-218X(83)90003-3
-
T. Kikuno, N. Yoshida, and Y. Kakuda A linear algorithm for the domination number of a series-parallel graph Discrete Appl. Math. 5 1983 299 311 (Pubitemid 13545503)
-
(1983)
Discrete Applied Mathematics
, vol.5
, Issue.3
, pp. 299-311
-
-
Kikuno Tohru1
Yoshida Noriyoshi2
Kakuda Yoshiaki3
-
26
-
-
84868002812
-
-
Master Thesis, University of New Brunswick, New Brunswick, Canada
-
K. Kilakos, On the complexity of edge domination, Master Thesis, University of New Brunswick, New Brunswick, Canada, 1988.
-
(1988)
On the Complexity of Edge Domination
-
-
Kilakos, K.1
-
28
-
-
43949154857
-
Combinatorial algorithms on a class of graphs
-
N.M. Korneyenko Combinatorial algorithms on a class of graphs Discrete Appl. Math. 54 1994 215 217
-
(1994)
Discrete Appl. Math.
, vol.54
, pp. 215-217
-
-
Korneyenko, N.M.1
-
29
-
-
0011350906
-
Vertex and edge domination parameters in graphs
-
R. Laskar, and K. Peter Vertex and edge domination parameters in graphs Congr. Numer. 48 1985 291 305
-
(1985)
Congr. Numer.
, vol.48
, pp. 291-305
-
-
Laskar, R.1
Peter, K.2
-
30
-
-
0043223521
-
Solving the weighted efficient edge domination problem on bipartite permutation graphs
-
PII S0166218X98000572
-
C.L. Lu, and C.Y. Tang Solving the weighted efficient edge domination problem on bipartite permutation graphs Discrete Appl. Math. 87 1998 203 211 (Pubitemid 128405706)
-
(1998)
Discrete Applied Mathematics
, vol.87
, Issue.1-3
, pp. 203-211
-
-
Lu, C.L.1
Tang, C.Y.2
-
31
-
-
0010680427
-
Edge domination in trees
-
eds. F. Hoffman, L. Lesniak-Foster, D. McCarthy, R.C. Mullin, K.B. Reid and R.G. Stanton, Winnipeg, Canada
-
S. Mitchell, S. Hedetniemi, Edge domination in trees, in: Proc. Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, eds. F. Hoffman, L. Lesniak-Foster, D. McCarthy, R.C. Mullin, K.B. Reid and R.G. Stanton, Winnipeg, Canada, 1977, pp. 489-509.
-
(1977)
Proc. Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica
, pp. 489-509
-
-
Mitchell, S.1
Hedetniemi, S.2
-
32
-
-
0042514759
-
The parallel algorithms for determining edge-packing and efficient edge dominating sets in interval graphs
-
M. Pal, and G.P. Bhattacharjee The parallel algorithms for determining edge-packing and efficient edge dominating sets in interval graphs Parallel Algorithms and Applications 7 1995 193 207
-
(1995)
Parallel Algorithms and Applications
, vol.7
, pp. 193-207
-
-
Pal, M.1
Bhattacharjee, G.P.2
-
34
-
-
0000673493
-
Graph minors II - Algorithmic aspects of tree-width
-
N. Robertson, and P.D. Seymour Graph minors II - algorithmic aspects of tree-width J. Algorithms 7 1986 309 322
-
(1986)
J. Algorithms
, vol.7
, pp. 309-322
-
-
Robertson, N.1
Seymour, P.D.2
-
35
-
-
0001580189
-
Algorithmic aspect of vertex elimination on graphs
-
D.J. Rose, R.E. Tarjan, and G.S. Lueker Algorithmic aspect of vertex elimination on graphs SIAM J. Comput. 5 1976 266 283
-
(1976)
SIAM J. Comput.
, vol.5
, pp. 266-283
-
-
Rose, D.J.1
Tarjan, R.E.2
Lueker, G.S.3
-
36
-
-
0042454105
-
Edge domination on bipartite permutation graphs and cotriangulated graphs
-
A. Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, and M.S. Chang Edge domination on bipartite permutation graphs and cotriangulated graphs Inform. Process. Lett. 56 1995 165 171
-
(1995)
Inform. Process. Lett.
, vol.56
, pp. 165-171
-
-
Srinivasan, A.1
Madhukar, K.2
Nagavamsi, P.3
Pandu Rangan, C.4
Chang, M.S.5
-
38
-
-
0020767156
-
Steiner trees, partial 2-trees and minimum IFI network
-
J.A. Wald, and C.J. Colbourn Steiner trees, partial 2-trees and minimum IFI network Networks 13 1983 159 167
-
(1983)
Networks
, vol.13
, pp. 159-167
-
-
Wald, J.A.1
Colbourn, C.J.2
-
41
-
-
0012487270
-
The weighted perfect domination problem and its variants
-
DOI 10.1016/0166-218X(94)00138-4
-
C.C. Yen, and R.C.T. Lee The weighted perfect domination problem and its variants Discrete Appl. Math. 66 1996 147 160 (Pubitemid 126374618)
-
(1996)
Discrete Applied Mathematics
, vol.66
, Issue.2
, pp. 147-160
-
-
Yen, C.-C.1
Lee, R.C.T.2
|