# Graph labeling

## Papers overview

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

2008

2008

- 2008

The problem of deciding whether two graphs are isomorphic is fundamental in graph theory. Moreover, the flexibility with whichâ€¦Â (More)

Is this relevant?

2007

2007

- 2007

An anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a bijection from the set of edges toâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- ICCV
- 2003

Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). Anâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- ICCBR
- 2003

This paper proposes a similarity measure to compare cases represented by labeled graphs. We first define an expressive model ofâ€¦Â (More)

Is this relevant?

1999

1999

- Graph Drawing
- 1999

Combinations of graph drawing and map labeling problems yield challenging mathematical problems and have direct applications, e.gâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Journal of Graph Theory
- 1998

The vertex-labeling of graphs with nonnegative integers provides a natural setting in which to study problems of radio channelâ€¦Â (More)

Is this relevant?

1997

1997

- CVPR
- 1997

This paper deals with the problem of motion-based segmentation of image sequences. Such partitions are multiple-purpose inâ€¦Â (More)

Is this relevant?

Review

1996

Review

1996

- 1996

A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelingsâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Neural Networks
- 1988

-A model for position invariant pattern recognition is presented. Although not demonstrated here, the system is insensitive toâ€¦Â (More)

Is this relevant?

1974

1974

- Discrete Mathematics
- 1974

Two efficient computer implemented algorithms are presented -=. :'or explicitly constructing all distinct labelings of a graph Gâ€¦Â (More)

Is this relevant?