Sciweavers

140 search results - page 17 / 28
» Maximum Series-Parallel Subgraph
Sort
View
PRL
2011
13 years 21 days ago
Structural matching of 2D electrophoresis gels using deformed graphs
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
NETWORKING
2007
13 years 11 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen
ENDM
2007
140views more  ENDM 2007»
13 years 9 months ago
Acyclic dominating partitions
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
Louigi Addario-Berry, Ross J. Kang
ENDM
2007
88views more  ENDM 2007»
13 years 9 months ago
Graph coloring with no large monochromatic components
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
Nathan Linial, Jirí Matousek, Or Sheffet, G...
SODA
2008
ACM
70views Algorithms» more  SODA 2008»
13 years 11 months ago
Optimal universal graphs with deterministic embedding
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
Noga Alon, Michael R. Capalbo