3204 search results - page 73 / 641 » The Alcuin Number of a Graph |
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
101
Voted
PVLDB
2010
14 years 8 months ago
2010
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
76
Voted
GD
2006
Springer
15 years 1 months ago
2006
Springer
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...
81
Voted
CCCG
1997
14 years 11 months ago
1997
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...
APPML
2005
14 years 10 months ago
2005
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...