-
1
-
-
0017216776
-
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
-
K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, JCSS, 13 (1976), pp. 335-379.
-
(1976)
JCSS
, vol.13
, pp. 335-379
-
-
Booth, K.S.1
Lueker, G.S.2
-
3
-
-
0032273496
-
The ultimate interval graph recognition algorithm?
-
D. G. Corneil, S. Olariu, and L. Stewart, The ultimate interval graph recognition algorithm? Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 9 (1998), pp. 175-180.
-
(1998)
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
, vol.9
, pp. 175-180
-
-
Corneil, D.G.1
Olariu, S.2
Stewart, L.3
-
5
-
-
0002521124
-
Transitiv orientierbare Graphen
-
T. Gallai, Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar., 18 (1967), pp. 25-66.
-
(1967)
Acta Math. Acad. Sci. Hungar.
, vol.18
, pp. 25-66
-
-
Gallai, T.1
-
7
-
-
0002482188
-
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
-
M. Habib, R. M. McConnell, C. Paul, and L. Viennot, Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoretical Computer Science, 234 (2000), pp. 59-84.
-
(2000)
Theoretical Computer Science
, vol.234
, pp. 59-84
-
-
Habib, M.1
McConnell, R.M.2
Paul, C.3
Viennot, L.4
-
8
-
-
77950855399
-
A simple test for interval graphs
-
W. L. Hsu, A simple test for interval graphs, Lecture Notes in Computer Science, 657 (1993), pp. 11-16.
-
(1993)
Lecture Notes in Computer Science
, vol.657
, pp. 11-16
-
-
Hsu, W.L.1
-
10
-
-
0024610616
-
An incremental linear-time algorithm for recognizing interval graphs
-
N. Korte and R. H. Möhring, An incremental linear-time algorithm for recognizing interval graphs, SIAM Journal on Computing, 18 (1989), pp. 68-81.
-
(1989)
SIAM Journal on Computing
, vol.18
, pp. 68-81
-
-
Korte, N.1
Möhring, R.H.2
-
11
-
-
0002215434
-
Representation of finite graphs by a set of intervals on the real line
-
C. Lekkerkerker and D. Boland, Representation of finite graphs by a set of intervals on the real line, Fund. Math. 51 (1962), 45-64.
-
(1962)
Fund. Math.
, vol.51
, pp. 45-64
-
-
Lekkerkerker, C.1
Boland, D.2
-
12
-
-
0000848263
-
Modular decomposition and transitive orientation
-
R. M. McConnell and J. P. Spinrad, Modular decomposition and transitive orientation, Discrete Mathematics, 201 (1999), pp. 189-241.
-
(1999)
Discrete Mathematics
, vol.201
, pp. 189-241
-
-
McConnell, R.M.1
Spinrad, J.P.2
-
14
-
-
0013141214
-
Transitive orientation of graphs and identification of permutation graphs
-
A. Pnueli, A. Lempel and S. Even, Transitive orientation of graphs and identification of permutation graphs, Canad. J. Math., 23 (1971), pp. 160-175.
-
(1971)
Canad. J. Math.
, vol.23
, pp. 160-175
-
-
Pnueli, A.1
Lempel, A.2
Even, S.3
-
15
-
-
0001580189
-
Algorithmic aspects of vertex elimination on graphs
-
D. J. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
-
(1976)
SIAM J. Comput.
, vol.5
, pp. 266-283
-
-
Rose, D.J.1
Tarjan, R.E.2
Lueker, G.S.3
-
16
-
-
0038183159
-
Addendum: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
-
R. E. Tarjan and M. Yannakakis, Addendum: simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput., 14 (1985), pp. 254-255.
-
(1985)
SIAM J. Comput.
, vol.14
, pp. 254-255
-
-
Tarjan, R.E.1
Yannakakis, M.2
-
17
-
-
0031274275
-
Software reliability via run-time result-checking
-
H. Wasserman and M. Blum, Software reliability via run-time result-checking, JACM, 44 (1997), pp. 826-849.
-
(1997)
JACM
, vol.44
, pp. 826-849
-
-
Wasserman, H.1
Blum, M.2
|