1883 search results - page 88 / 377 » Ordered theta graphs |
ICCV
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
APSEC
2004
IEEE
13 years 11 months ago
2004
IEEE
Software engineers need to understand programs in order to effectively maintain them. The call graph, which presents the calling relationships between functions, is a useful repre...
FLAIRS
2006
13 years 9 months ago
2006
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
EJC
2007
13 years 7 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
SIAMDM
2008
13 years 7 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...