1477 search results - page 97 / 296 » On Graph Problems in a Semi-streaming Model |
120
click to vote
CIAC
2006
Springer
15 years 5 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
102
click to vote
EURODAC
1994
IEEE
15 years 5 months ago
1994
IEEE
This paper addresses the problem of design rule correct routing, i.e. the avoidance of illegal wiring patterns during routing. These illegal wiring patterns are due to the set of ...
123
click to vote
CPC
2006
15 years 1 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
129
click to vote
SIGSOFT
2009
ACM
16 years 2 months ago
2009
ACM
A bug report is typically assigned to a single developer who is then responsible for fixing the bug. In Mozilla and Eclipse, between 37%-44% of bug reports are "tossed" ...
150
click to vote
ICCS
1999
Springer
15 years 5 months ago
1999
Springer
Conceptual Graphs and Formal Concept Analysis have in common basic concerns: the focus on conceptual structures, the use of diagrams for supporting communication, the orientation b...