Sciweavers

3396 search results - page 53 / 680
» Tree representations of graphs
Sort
View
105
Voted
GD
2008
Springer
15 years 1 months ago
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu
89
Voted
CORR
2004
Springer
111views Education» more  CORR 2004»
15 years 12 days ago
Layout of Graphs with Bounded Tree-Width
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...
Vida Dujmovic, Pat Morin, David R. Wood
102
Voted
ICPR
2008
IEEE
15 years 7 months ago
Online adaptive clustering in a decision tree framework
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
Jayanta Basak
106
Voted
ICSE
2008
IEEE-ACM
16 years 1 months ago
Scalable detection of semantic clones
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
Mark Gabel, Lingxiao Jiang, Zhendong Su
ICNP
2007
IEEE
15 years 6 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...