Sciweavers

253 search results - page 29 / 51
» Testing subgraphs in directed graphs
Sort
View
COCOA
2008
Springer
13 years 11 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
ECRTS
2010
IEEE
13 years 11 months ago
Partitioning Parallel Applications on Multiprocessor Reservations
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...
Giorgio C. Buttazzo, Enrico Bini, Yifan Wu
MVA
2008
13 years 9 months ago
Retrieving articulated 3-D models using medial surfaces
Abstract We consider the use of medial surfaces to represent symmetries of 3-D objects. This allows for a qualitative abstraction based on a directed acyclic graph of components an...
Kaleem Siddiqi, Juan Zhang, Diego Macrini, Ali Sho...
BMCBI
2008
97views more  BMCBI 2008»
13 years 10 months ago
Large-scale directional relationship extraction and resolution
Background: Relationships between entities such as genes, chemicals, metabolites, phenotypes and diseases in MEDLINE are often directional. That is, one may affect the other in a ...
Cory B. Giles, Jonathan D. Wren
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 7 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...