Sciweavers

6 search results - page 1 / 2
» Finding Induced Paths of Given Parity in Claw-Free Graphs
Sort
View
WG
2009
Springer
13 years 11 months ago
Finding Induced Paths of Given Parity in Claw-Free Graphs
Pim van 't Hof, Marcin Kaminski, Daniël Paulu...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 3 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
JDA
2010
122views more  JDA 2010»
12 years 11 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
DAM
2008
123views more  DAM 2008»
13 years 4 months ago
Polar cographs
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
Tinaz Ekim, Nadimpalli V. R. Mahadev, Dominique de...
JCO
2006
126views more  JCO 2006»
13 years 4 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li