Sciweavers

2503 search results - page 86 / 501
» A study of 3-arc graphs
Sort
View
STOC
2006
ACM
112views Algorithms» more  STOC 2006»
16 years 6 months ago
A quasi-PTAS for unsplittable flow on line graphs
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Bar...
AUSAI
2009
Springer
16 years 21 days ago
A Graph Distance Based Structural Clustering Approach for Networks
In the era of information explosion, structured data emerge on a large scale. As a description of structured data, network has drawn attention of researchers in many subjects. Netw...
Xin Su, Chunping Li
CAI
2009
Springer
16 years 20 days ago
The Graph Programming Language GP
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
Detlef Plump
SCAM
2008
IEEE
16 years 14 days ago
Change Impact Graphs: Determining the Impact of Prior Code Changes
The source code of a software system is in constant change. The impact of these changes spreads out across the software system and may lead to the sudden manifestation of failures...
Daniel M. Germán, Gregorio Robles, Ahmed E....
ICTAI
2007
IEEE
16 years 12 days ago
A Probabilistic Substructure-Based Approach for Graph Classification
The classification of graph based objects is an important challenge from a knowledge discovery standpoint and has attracted considerable attention recently. In this paper, we pres...
H. D. K. Moonesinghe, Hamed Valizadegan, Samah Jam...