Sciweavers

384 search results - page 13 / 77
» On s-hamiltonian-connected line graphs
Sort
View
CIB
2005
125views more  CIB 2005»
13 years 8 months ago
An On-Line Web Visualization System with Filtering and Clustering Graph
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...
Wei Lai, Xiaodi Huang, Ronald Wibowo, Jiro Tanaka
JGT
2007
85views more  JGT 2007»
13 years 8 months ago
Coloring quasi-line graphs
A graph G is a quasi-line graph if for every vertex v, the set of neighbors of v can be expressed as the union of two cliques. The class of quasi-line graphs is a proper superset ...
Maria Chudnovsky, Alexandra Ovetsky
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
13 years 8 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 1 months ago
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Ross M. McConnell, Yahav Nussbaum
JGT
2010
158views more  JGT 2010»
13 years 7 months ago
Cubicity of interval graphs and the claw number
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
Abhijin Adiga, L. Sunil Chandran