Skip to search formSkip to main contentSkip to account menu

Graph labeling

Known as: Lucky labeling, Edge labeled graph, Vertex labeled graph 
In the mathematical discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to the edges or… 
Wikipedia (opens in a new tab)

Related topics

Related topics

18 relations
Automata theoryCaterpillar treeDijkstra's algorithmEdge-graceful labeling

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A Binary String Approach for Updates in Dynamic Ordered XML Data
To facilitate XML query processing, several labeling schemes have been proposed, in which the ancestor-descendant and parent… 
2010
2010
Euler ’ s Phi Function and Graph Labeling
A graph G(V,E) with vertex set V is said to have a prime labeling if there exist a bijection f : V (G) → {1, 2, . . . , |V… 
2009
2009
Epsilon Equitable Partition: A positional analysis method for large social networks
Positional analysis is considered an important tool in the analysis of social networks. It involves partitioning of the set of… 
Highly Cited
2008
Highly Cited
2008
Conditional Random Fields for Integrating Local Discriminative Classifiers
Conditional random fields (CRFs) are a statistical framework that has recently gained in popularity in both the automatic speech… 
2007
2007
A study on multimedia documents behavior: a notion of equivalence
In this paper we address the problem of comparing multimedia documents, which can be described according to different reference… 
2003
2003
A System for Keyword Proximity Search on XML Databases
2000
2000
Graphical Operational Semantics
We combine the methodology of Plotkin-style operational semantics with graph transformation concepts in order to specify the… 
1994
1994
Genetic Programming with Local Hill-Climbing
This paper proposes a new approach to Genetic Programming (GP). In traditional GP, recombination can cause frequent disruption of… 
1991
1991
Flexible, fault-tolerant routing criteria for circuit-switched hypercubes
A set of routing criteria is proposed for circuit-switched hypercubes that exploit the flexibility provided by the hypercube. The… 
Highly Cited
1980
Highly Cited
1980
Recognition of handprinted Tamil characters
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)