The cost of monotonicity in distributed graph searching

ISSN： 0178-2770

Source： Distributed Computing, Vol.22, Iss.2, 2009-10, pp. : 117-127

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

Graph based characterization of distributed applications

By Kotsis G. Braun M.

Future Generation Computer Systems, Vol. 16, Iss. 6, 2000-04 ,pp. : 597-607

Elsevier

Access to resources Recommend Favorite

Combinatorial algorithms for distributed graph coloring

By Barenboim Leonid Elkin Michael

Distributed Computing, Vol. 27, Iss. 2, 2014-04 ,pp. : 79-93

Springer Publishing Company

Access to resources Recommend Favorite

Nondeterministic Graph Searching: From Pathwidth to Treewidth

By Fomin Fedor Fraigniaud Pierre Nisse Nicolas

Algorithmica, Vol. 53, Iss. 3, 2009-03 ,pp. : 358-373

Springer Publishing Company

Access to resources Recommend Favorite

Graph Searching, Elimination Trees, and a Generalization of Bandwidth

By Fomin Fedor V. Heggernes Pinar Telle Jan Arne

Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. : 73-87

Springer Publishing Company

Access to resources Recommend Favorite

Agent Technology concepts in a heterogeneous distributed searching environment

By Dent Valeda Frances Hall Wendy Harris Stephen Hey Jessie Martinez Kirk

VINE, Vol. 31, Iss. 2, 2001-06 ,pp. : 55-63

Emerald Group Publishing Ltd

Access to resources Recommend Favorite