1986 search results - page 273 / 398 » Path Separability of Graphs |
103
click to vote
ICSE
2004
IEEE-ACM
16 years 2 months ago
2004
IEEE-ACM
Abstract. Building systems from existing applications written in two or more languages is common practice. Such systems are polylingual. Polylingual systems are relatively easy to ...
114
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
93
Voted
AGILE
2009
Springer
15 years 9 months ago
2009
Springer
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
104
Voted
FMCAD
2009
Springer
15 years 9 months ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
146
Voted
BIBE
2007
IEEE
15 years 9 months ago
2007
IEEE
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...