Sciweavers

2503 search results - page 24 / 501
» A study of 3-arc graphs
Sort
View
GG
2004
Springer
14 years 3 months ago
Towards Graph Programs for Graph Algorithms
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
Detlef Plump, Sandra Steinert
PVLDB
2010
110views more  PVLDB 2010»
13 years 8 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
IPL
2007
94views more  IPL 2007»
13 years 9 months ago
A note on the Hadwiger number of circular arc graphs
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chan...
JGAA
2007
93views more  JGAA 2007»
13 years 9 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger
WAOA
2010
Springer
275views Algorithms» more  WAOA 2010»
13 years 7 months ago
Online Ranking for Tournament Graphs
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
Claire Mathieu, Adrian Vladu