On best transitive approximations to simple graphs

Acta Informatica

Volumn 40, Issue 9, 2004, Pages 637-655

  Delvaux, Steven ^a   Horsten, Leon ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

INTERLOCKING; TRANSITIVE APPROXIMATIONS; TRANSITIVE GRAPHS;

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; SET THEORY; THEOREM PROVING;

COMPUTER SCIENCE;

EID: 5044222689     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00236-004-0144-0     Document Type: Article

References (10)

1. Blum, N. (1990) A new approach to maximum matchings in general graphs. In: Paterson, M. (ed.) ICALP 90: Automata, Languages and Programming (LNCS 443) 17: 586-597
2. De Clercq, R., Horsten, L. Closer. Synthese (to appear)
3. Garey, M.R., Johnson, D.S., Stockmeyer, L. (1976) Some simplified NP-complete graph problems. Theoretical Computer Science 1: 237-267
4. Krantz, S. (2002) Logic and proof techniques for computer science. Birkhäuser
5. Krivanek, M., Moravek, J. (1986) NP-hard problems in hierarchical tree-clustering. Acta Informatica 23: 311-323
6. Moon, J.W. (1966) A note on approximating symmetric relations by equivalence classes. SIAM Journal of Applied Mathematics 14: 226-227
7. Tomescu, I. (1974) La réduction minimale d'un graphe à une réunion de cliques. Discrete Mathematics 10: 173-179
8. Williamson, T. (1986) Criteria of identity and the axiom of choice. Journal of Philosophy 83: 380-394
9. Williamson, T. (1990) Identity and discrimination. Blackwell
10. Zahn, C.T., Jr. (1964) Approximating symmetric relations by equivalence relations. SIAM Journal of Applied Mathematics 12: 840-847