Sciweavers

1027 search results - page 43 / 206
» Ordered Vertex Partitioning
Sort
View
BIRTHDAY
2009
Springer
14 years 4 months ago
Covering a Tree by a Forest
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
Fanica Gavril, Alon Itai
CATS
2008
13 years 11 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
13 years 9 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
ECCTD
2011
63views more  ECCTD 2011»
12 years 9 months ago
Ladder-Biquad filter partitioning for on-chip tuning
— One of the problems with on-chip active-RC filters is that in order to satisfy tight specifications accurately, they need to be fine-tuned. This becomes more difficult with inc...
Drazen Jurisic, George S. Moschytz
ICDM
2007
IEEE
192views Data Mining» more  ICDM 2007»
14 years 4 months ago
Discovering Temporal Communities from Social Network Documents
Discovering communities from documents involved in social discourse is an important topic in social network analysis, enabling greater understanding of the relationships among act...
Ding Zhou, Isaac G. Councill, Hongyuan Zha, C. Lee...