244 search results - page 38 / 49 » Intervalizing k-Colored Graphs |
WG
2005
Springer
15 years 2 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
ASUNAM
2009
IEEE
15 years 2 months ago
2009
IEEE
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...
97
Voted
DSS
2002
14 years 9 months ago
2002
A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow managemen...
VLDB
2004
ACM
15 years 2 months ago
2004
ACM
Different models have been proposed recently for representing temporal data, tracking historical information, and recovering the state of the document as of any given time, in XM...
77
Voted
VISUALIZATION
2000
IEEE
15 years 1 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...