-
1
-
-
0022808049
-
Finding a maximum clique in an arbitrary graph
-
E. Balas and C.S. Yu, Finding a maximum clique in an arbitrary graph, SIAM J. Comput. 15 (4) (1986) 1054-1068.
-
(1986)
SIAM J. Comput.
, vol.15
, Issue.4
, pp. 1054-1068
-
-
Balas, E.1
Yu, C.S.2
-
2
-
-
84972514233
-
Incidence matrices and interval graphs
-
D.R. Fulkerson and O. Gross, Incidence matrices and interval graphs, Pacific J. Math. 15 (1965) 835-855.
-
(1965)
Pacific J. Math.
, vol.15
, pp. 835-855
-
-
Fulkerson, D.R.1
Gross, O.2
-
3
-
-
0000340664
-
Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph
-
F. Gavril, Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph, SIAM J. Comput. 1 (2) (1972) 180-187.
-
(1972)
SIAM J. Comput.
, vol.1
, Issue.2
, pp. 180-187
-
-
Gavril, F.1
-
4
-
-
46549090345
-
Weakly Triangulated Graphs
-
R. Hayward, Weakly Triangulated Graphs, J. Combin. Theory Ser. B 39 (1985) 200-209.
-
(1985)
J. Combin. Theory Ser. B
, vol.39
, pp. 200-209
-
-
Hayward, R.1
-
5
-
-
0003037529
-
Reducibility among combinatorial problems
-
Miller and Thatcher, eds., Plenum Press, New York
-
E.C. Karp, Reducibility among combinatorial problems, in: Miller and Thatcher, eds., Complexity of Computer Computation (Plenum Press, New York, 1972) 85-103.
-
(1972)
Complexity of Computer Computation
, pp. 85-103
-
-
Karp, E.C.1
-
6
-
-
0014928358
-
Triangulated graphs and the elimination process
-
D.J. Rose, Triangulated graphs and the elimination process, J. Math. Anal. Appl. 32 (1970) 597-609.
-
(1970)
J. Math. Anal. Appl.
, vol.32
, pp. 597-609
-
-
Rose, D.J.1
-
7
-
-
0001580189
-
Algorithmic aspects of vertex elimination on graphs
-
D.J. Rose, R. Tarjan and G. Leuker, Algorithmic aspects 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.2
Leuker, G.3
-
8
-
-
0021473698
-
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraph and selectively reduce acyclic hypergraph
-
R. Tarjan and M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraph and selectively reduce acyclic hypergraph, SIAM J. Comput. 13 (3) (1984) 566-579.
-
(1984)
SIAM J. Comput.
, vol.13
, Issue.3
, pp. 566-579
-
-
Tarjan, R.1
Yannakakis, M.2
-
9
-
-
84992286317
-
Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem
-
J. Xue, Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem, Networks 24 (1994) 109-120.
-
(1994)
Networks
, vol.24
, pp. 109-120
-
-
Xue, J.1
|