Sciweavers

723 search results - page 17 / 145
» On the hyperbolicity constant in graphs
Sort
View
SEMWEB
2009
Springer
14 years 1 months ago
Node-Link and Containment Methods in Ontology Visualization
OWL Ontology language can be very expressive. This could provide difficulty in ontology understanding process. We belief, that an ontology visualization equipped with intuitive int...
Julia Dmitrieva, Fons J. Verbeek
CPC
1998
64views more  CPC 1998»
13 years 7 months ago
Isoperimetric Inequalities for Cartesian Products of Graphs
We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the ...
Fan R. K. Chung, Prasad Tetali
FAW
2010
Springer
232views Algorithms» more  FAW 2010»
13 years 8 months ago
Recognizing d-Interval Graphs and d-Track Interval Graphs
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval...
Minghui Jiang
IPL
2008
98views more  IPL 2008»
13 years 7 months ago
On the number of Go positions on lattice graphs
We use transfer matrix methods to determine bounds for the numbers of legal Go positions for various numbers of players on some planar lattice graphs, including square lattice gra...
Graham Farr, Johannes Schmidt
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
11 years 9 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...