Martin Charles Golumbic
Ron Shamir
- 1 ~AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D.The Design and Analysts oJ Computer ~Algorithms. Addison Wesley, Reading Mass., 1974. Google Scholar
Digital Library
- 2 ~ALLEN, J.F. Maintaining knowledge about temporal intervals. Commun. ACM 26, 11 (Nov. ~1983) 832-843. Google ScholarDigital Library
- 3 ~BAKER, K. R., F1SHBURN, P. C., AND ROBERTS, F.S. Partial orders of dimension 2. Networks ~2 (1972) 11-28.Google Scholar
- 4 ~BELFER, A., AND GOLUMB1C, M.C. Counting endpoint sequences for interval orders and ~interval graphs. Disc. Math., 114 (1993), 23-39. Google ScholarDigital Library
- 5 ~BELbER, A., AND GOLUMBIC, M. C. A combinatorial approach to temporal reasoning. In ~Proceedings of tile 5th Jen~salem Cortfereltce on Informattotz Technology, (Oct.). 1EEE Com- ~puter Society Press, 1990, 774-780. Google ScholarDigital Library
- 6 ~BELFER, A., AND GOLUMBIC, M. C. The role of combinatorial structures in temporal ~reasoning. Manuscript.Google Scholar
- 7 ~BENZER, S. On the topology of the genetic fine structure. Proc. Nat. Acad. Sci. USA 45 (1959), 1607-1620.Google ScholarCross Ref
- 8 ~BOOTH, K. S., AND LUEKER, G. S. Testing for the consecutive ones property, interval ~graphs, and planarity using PQ-tree algorithms. J. Comput. Svs. Scl. 13 (1976), 335 379.Google Scholar
- 9 ~BOUCHET, A. Reducing prime graphs and recognizing circle graphs. Combtnatorica 7 ~(1987), 243-254. Google ScholarDigital Library
- 10 ~BRIGHTWELL, G, AND WINKLER, P. Counting linear extensions is #P-complete' In Pro- ~ceedlngs of the 23rd Annual ACM Symposzum on Theory of Computing (ACM, New York), ~199l, pp. 175-181. Google ScholarDigital Library
- 11 ~CARRANO, A.V. Establishing the order of human chromosome-specific DNA fragments. In ~Blotechnologv and the Human Genome, A D. Woodhead and B. J. Barnhart, eds., Plenum ~Press, New York, (1988), 37 50.Google Scholar
- 12 ~COOMBS, C. H., AND SMITH, J. E. K. On the detection of structures in atntudes and ~developmental processes. Psych. Rev. 80 (1973), 337-351.Google ScholarCross Ref
- 13 ~DUSHNm, B., AND MILLER, E. W. Partially ordered sets Amer. J Math. 63 (1941), ~600-610.Google ScholarCross Ref
- 14 ~FISHBURN, P. Intert,al Orders and lnterz'al Graphs. Wiley, New York, 1985.Google Scholar
- 15 ~FiSHBURN, P. Interval graphs and interval orders. Dtsc. Math 55 (1985), 135 149.Google Scholar
- 16 ~FISHBURN, P Intransitive indifference with unequal indifference intervals. J. Math. Psych. ~7 (1970), 144-149.Google Scholar
- 17 ~FULKERSON, D. R., AND GROSS, O A. Incidence matrices and interval graphs. Pac'(zc J. ~Math. 15 ( 1965), 835-855.Google Scholar
- 18 ~GABOR, C. P., SUPOWIT, K. J., AND HSU, W-L. Recognizing circle graphs in polynomial ~time. J. ACM 36, 3 (July 1989), 435-473. Google ScholarDigital Library
- 19 ~GILMORE, P. C., AND HOFFMAN, A.J. A characterization of comparabdlty graphs and of ~interval graphs. Canad. J. Math. 16 (1964), 539-548.Google ScholarCross Ref
- 20 ~GOLLIMBI~, M C. Interval graphs and related topics. Disc. A{ath. 55 (1985), 113 121.Google Scholar
- 21 GOLUMBIC, M.C. Algorzthmtc Graph Theoo' and Petfect Gtzlphs. Academic Press, Orlando, ~Fla., 1980.Google Scholar
- 22 GOLUMBIC, M. C., AND SCHEINERMAN, n. R. Containment graphs, posets and related ~classes of graphs. Ann. N.Y. Acad. Scl 555 (1989), 192-204.Google ScholarCross Ref
- 23 ~HAJOS, G. Uber elne Art yon Graphen. Intern. Math. Nachr. ll (1957), problem 65.Google Scholar
- 24 ~HOCHBAUM, D. S., AND NAOR, J Simple and fast algorithms for linear and Integer ~problems with two variables per inequality. In Proceedilzgs of 11~C0 92, Integer Programming ~and Combinatorial Optimization. Carnegie Mellon University Press, Pittsburgh, Pa., 1992, pp. ~44-59.Google Scholar
- 25 ~KENDALL, D.G. Incidence matrices, interval graphs, and seriation in archaeology. PaczficJ. ~Math. 28 (1969), 565-570.Google Scholar
- 26 ~KENDALL, D.G. Some problems and methods in statistical archaeology. World Archaeol. 1 ~(1969), 68 76.Google Scholar
- 27 ~KORTE, N., AND M()I-tRING, R. H. An incremental linear rime algorithm for recognizing ~interval graphs. SIAM J. Comput. 18 (1989), 68-81. Google ScholarDigital Library
- 28 ~KORTE, N., AND MOIIRING. R.H. Transitive orientation of graphs with s~de constraints. In ~Proceedings of WG'85, lntertlatlotlal Workshop on Graph Theorettc Concepts zn Computer ~Science, H. Noltemcier, ed. Universltatsvcrlag Rudolf Trauner, Linz, 1985, 143 160.Google Scholar
- 29 ~LADKIN, P. B., AND MADDUX, R. The algebra of constraint satisfaction problems and ~temporal reasoning. Tech. Rep. Kestrel Institute, Palo Alto, Calif., 1988.Google Scholar
- 30 ~LEKKERKERKER, C. G., AND BOLAND, J. CH. Representation of a finite graph by a set of ~interval on the real line. Ftnzdam. Math. 51 (1962), 45-64.Google Scholar
- 31 ~NOKEL, K. Temporally distributed symptoms in techmcal diagnosis. Lecture Notes m ~Arttficial Intelligence, vol. 517. Springer-Verlag, New York, 1991. Google ScholarDigital Library
- 32 ~NUDEL, B. Consistent-labeling problems and their algorithms: Expected complexities and theory-based heuristics. Artif. Int. 21 (1983), 135 178.Google Scholar
- 33 APADIMITRIOU, C., AND YANNAKAKIS, M. Scheduling interval ordered tasks. SIAM J. omput. 8 (1979), 405 409,Google Scholar
- 33a ~Pruesse, G., and Ruskey, F. Generating linear extensions fast. SIAMZ Conzput., to appear. Google ScholarDigital Library
- 34 ~ROBERTS., F.S. Discrete Mathematical Models, wzth Applications to Social Btologteal at~d ~Enclronmental Problems. Prentice-Hall, Englewood Cliffs, N.J., 1976Google Scholar
- 35 ~SCHAEFER, T.J. The complexity of satisfiabfiity problems. In Proceedings of the lOth Atmual ~ACM Symposm,z on Theoff of Computing, ACM, New York, 1978, pp. 216-226. Google ScholarDigital Library
- 36 ~SKRIEN, D. Chronological ordering of interval graphs. Disc'. Aippl. Math. 8 (t984), 69 83.Google Scholar
- 37 ~TARJAN, R.E. Depth-first search and linear graph algorithms. S1AMJ. Computmg 1 (1972), ~146-160.Google Scholar
- 38 ~TARSK1, A. On the calculus of rclatlons J. Sym, Logic 6 (194I), 73 89.Google Scholar
- 39 ~VAN BEEK, P. Temporal query processing with indefinite information. Artif. hzt. Med. 3 ~(1991), 329-339.Google Scholar
- 40 ~VAN BEEK, P. Reasoning about qualitative temporal information. In Proceedings of tile 8th ~National Conference on Artificial Intelligence (AAAI-90) (Aug.) 1990, pp. 728-734.Google Scholar
- 41 ~VAN BEEK, P. Approximation algorithms for temporal reasoning. In Proceedings of the 11th ~International Joint Conference on Artificial Intelligence ( I. ICA1-89 ) (Aug.) 1989, pp. 1291-1296.Google Scholar
- 42 ~VILIAN, M., AND KAUTZ, H. Constraint propagation algorithms for temporal reasoning. In ~Proceedings of the 5th National Conference on ArtijScial hztelligence ( AAA1-86) (Aug.) 1986, ~pp. 337-382.Google Scholar
- 43 ~WARD, S. A., AND HALSTEAD, R.H. Computation Structures. MIT Press, Cambridge, Mass., ~1990. Google ScholarDigital Library
Index Terms
- Complexity and algorithms for reasoning about time: a graph-theoretic approach
Recommendations
Complexity and Algorithms for Semipaired Domination in Graphs
Combinatorial AlgorithmsAbstractFor a graph with no isolated vertices, a set is called a semipaired dominating set of G if (i) D is a dominating set of G, and (ii) D can be partitioned into two element subsets such that the vertices in each two element set are at distance at ...
Complexity and Algorithms for Semipaired Domination in Graphs
AbstractFor a graph G = (V, E) with no isolated vertices, a set is called a semipaired dominating set of G if (i)D is a dominating set of G, and (ii)D can be partitioned into two element subsets such that the vertices in each two element set are at ...
Efficient algorithms for Roman domination on some classes of graphs
A Roman dominating function of a graph G=(V,E) is a function f:V->{0,1,2} such that every vertex x with f(x)=0 is adjacent to at least one vertex y with f(y)=2. The weight of a Roman dominating function is defined to be f(V)=@?"x"@?"Vf(x), and the ...
Comments