Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

Abstract Many graph invariants have been used for the construction of entropy-based measures to characterize the structure of… Expand

Is this relevant?

Highly Cited

2011

Highly Cited

2011

Abstract The relationship between money and happiness is surprisingly weak, which may stem in part from the way people spend it… Expand

Is this relevant?

Highly Cited

2011

Highly Cited

2011

For a given simple graph G, the energy of G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

Service-oriented architecture (SOA) provides a scalable and flexible framework for service composition. Service composition… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We present in this paper a new, complete method for distributed constraint optimization, based on dynamic programming. It is a… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

The authors propose a topological analysis of large urban street networks based on a computational and functional graph… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

Abstract For an ordered subset W={w1,w2,…,wk} of vertices in a connected graph G and a vertex v of G, the metric representation… Expand

Is this relevant?

Highly Cited

1990

Highly Cited

1990

Abstract In their 1971 paper on the travelling salesman problem and minimum spanning trees, Held and Karp showed that finding an… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

Clean is an experimental language for specifying functional computations in terms of graph rewriting. It is based on an extension… Expand

Is this relevant?

Highly Cited

1985

Highly Cited

1985

Binary constraint sat is fact ion problems involve f ind ing values for variables subject to constraints between pairs of… Expand

Is this relevant?