Sciweavers

19 search results - page 1 / 4
» Polarities and 2k-cycle-free graphs
Sort
View
DAM
2008
123views more  DAM 2008»
13 years 7 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...
DAM
2008
90views more  DAM 2008»
13 years 7 months ago
Polarity of chordal graphs
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
Tinaz Ekim, Pavol Hell, Juraj Stacho, Dominique de...
NAACL
2010
13 years 5 months ago
The viability of web-derived polarity lexicons
We examine the viability of building large polarity lexicons semi-automatically from the web. We begin by describing a graph propagation framework inspired by previous work on con...
Leonid Velikovich, Sasha Blair-Goldensohn, Kerry H...
ACL
2010
13 years 5 months ago
Identifying Text Polarity Using Random Walks
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
Ahmed Hassan, Dragomir R. Radev
DM
1999
45views more  DM 1999»
13 years 7 months ago
Polarities and 2k-cycle-free graphs
Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Wo...