Search Sciweavers | Sciweavers

140 search results - page 6 / 28

» Maximum Series-Parallel Subgraph

click to vote

APPROX
2009
Springer

126views Algorithms» more APPROX 2009»

Improved Inapproximability Results for Maximum k-Colorable Subgraph

14 years 4 months ago

Download www.cs.cmu.edu

We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...

Venkatesan Guruswami, Ali Kemal Sinop

claim paper

Read More »

click to vote

WWW
2011
ACM

293views Internet Technology» more WWW 2011»

Web information extraction using Markov logic networks

13 years 4 months ago

Download www.it.iitb.ac.in

In this paper, we consider the problem of extracting structured data from web pages taking into account both the content of individual attributes as well as the structure of pages...

Sandeepkumar Satpal, Sahely Bhadra, Sundararajan S...

claim paper

Read More »

click to vote

ARSCOM
2006

100views more ARSCOM 2006»

On clique-perfect and K-perfect graphs

13 years 10 months ago

Download mate.dm.uba.ar

A graph G is clique-perfect if the cardinality of a maximum cliqueindependent set of H is equal to the cardinality of a minimum cliquetransversal of H, for every induced subgraph ...

Flavia Bonomo, Guillermo Durán, Marina Gros...

claim paper

Read More »

click to vote

CJ
2002

61views more CJ 2002»

RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs

13 years 9 months ago