Conference Proceedings

Bounds of graph characteristics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3709 LNCS 742-746
DOI: 10.1007/11564751_56
6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme is based on the bounds of the graph characteristics used in the description of a global constraint. The article provides bounds for the most common used graph characteristics. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Beldiceanu, N., Petit, T., & Rochart, G. (2005). Bounds of graph characteristics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 742–746). https://doi.org/10.1007/11564751_56

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free