1477 search results - page 105 / 296 » On Graph Problems in a Semi-streaming Model |
155
click to vote
EDBT
2012
ACM
13 years 6 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
150
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
163
click to vote
VL
2009
IEEE
15 years 11 months ago
2009
IEEE
Euler diagrams form the basis of several visual modelling notations, including statecharts and constraint diagrams. Recently, various techniques for automated Euler diagram drawin...
131
click to vote
CC
2003
Springer
15 years 9 months ago
2003
Springer
We define the Value State Dependence Graph (VSDG). The VSDG is a form of the Value Dependence Graph (VDG) extended by the addition of state dependence edges to model sequentialise...
224
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...