A general theory of sharing graphs

Author： Guerrini S.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.227, Iss.1, 1999-09, pp. : 99-151

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

A General Tractable Density Concept for Graphs

By Faragó András  

Mathematics in Computer Science, Vol. 1, Iss. 4, 2008-06 ,pp. : 689-699

Springer Publishing Company

Access to resources Recommend Favorite

General aggregation of demandand cost sharing methods

By Tijs S.   Koster M.  

Annals of Operations Research, Vol. 84, Iss. 1, 1998-01 ,pp. : 137-164

Springer Publishing Company

Access to resources Recommend Favorite

On infinite transition graphs having a decidable monadic theory

By Caucal D.  

Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. : 79-115

Elsevier

Access to resources Recommend Favorite

On directed information theory and Granger causality graphs

By Amblard Pierre-Olivier  

Journal of Computational Neuroscience, Vol. 30, Iss. 1, 2011-02 ,pp. : 7-16

Springer Publishing Company

Access to resources Recommend Favorite

Using existential graphs to integrate mental logic theory and mental model theory

By Van Heuveln Bram  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 18, Iss. 2, 2006-06 ,pp. : 149-155

Taylor & Francis Ltd

Access to resources Recommend Favorite