6598 search results - page 43 / 1320 » Graph Theory with Applications |
135
Voted
GD
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...
111
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
128
Voted
CVIU
2008
15 years 4 months ago
2008
The visual hull relates the shape of an object to its silhouettes. This paper develops the theory of the visual hull of piecewise smooth objects, as those used in CAD applications...
119
click to vote
ICCS
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we aim at showing the advantages of Conceptual Graph formalism for the Semantic Web through several real-world applications in the framework of Corporate Semantic We...
123
click to vote
SIAMDM
2008
15 years 3 months ago
2008
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...