Sciweavers

5473 search results - page 74 / 1095
» On the graph isomorphism problem
Sort
View
IWPEC
2004
Springer
15 years 5 months ago
Online Problems, Pathwidth, and Persistence
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
Rodney G. Downey, Catherine McCartin
TCS
2008
14 years 11 months ago
The computational complexity of the parallel knock-out problem
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
Hajo Broersma, Matthew Johnson 0002, Daniël P...
CORR
2008
Springer
169views Education» more  CORR 2008»
14 years 12 months ago
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
Mingyu Xiao, Leizhen Cai, Andrew C. Yao
EDBT
2012
ACM
257views Database» more  EDBT 2012»
13 years 2 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
14 years 10 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia