Efficiently searching a graph by a smell-oriented vertex process

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.24, Iss.1-4, 1998-02, pp. : 211-223

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Partitioning a graph into vertex-disjoint paths

By Li Jianping Steiner George

Studia Scientiarum Mathematicarum Hungarica, Vol. 42, Iss. 3, 2005-08 ,pp. : 277-294

Akademiai Kiado

Access to resources Recommend Favorite

On graphs in which the neighborhood of each vertex is the complementary graph of a seidel graph

By Kardanova M.

Doklady Mathematics, Vol. 82, Iss. 2, 2010-10 ,pp. : 762-764

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Graph Theory: A Problem Oriented Approach

By Cohen Marion Deutsche

American Mathematical Monthly, Vol. 117, Iss. 8, 2010-10 ,pp. : 749-753

Mathematical Association of America

Access to resources Recommend Favorite

Vertex Distinguishing Equitable Total Chromatic Number of Join Graph

By Wang Zhi-wen

Acta Mathematicae Applicatae Sinica, Vol. 23, Iss. 3, 2007-07 ,pp. : 433-438

Springer Publishing Company

Access to resources Recommend Favorite

A graph-theoretic approach to efficiently reason about partially ordered events in (Modal) Event Calculus

By Franceschet M.

Annals of Mathematics and Artificial Intelligence, Vol. 30, Iss. 1-4, 2000-01 ,pp. : 93-118

Springer Publishing Company

Access to resources Recommend Favorite