Sciweavers

650 search results - page 20 / 130
» Positive graphs
Sort
View
73
Voted
DM
1998
73views more  DM 1998»
14 years 11 months ago
On constructing snakes in powers of complete graphs
We prove the conjecture of Abbott and Katchalski that for every m ≥ 2 there is a positive constant λm such that S(Kd mn) ≥ λmnd−1 S(Kd−1 m ) where S(Kd m) is the length o...
Jerzy Wojciechowski
AAAI
2012
13 years 2 months ago
Computing the Nucleolus of Matching, Cover and Clique Games
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
Ning Chen, Pinyan Lu, Hongyang Zhang
CCCG
2007
15 years 1 months ago
Pointed Drawings of Planar Graphs
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
Oswin Aichholzer, Günter Rote, André S...
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
15 years 6 months ago
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
Lei Zou, Lei Chen 0002, Huaming Zhang, Yansheng Lu...
JCT
2006
80views more  JCT 2006»
14 years 11 months ago
Extending precolorings to circular colorings
Fix positive integers k , d , k, d such that k /d > k/d 2. If P is a set of vertices in a (k, d)-colorable graph G, and any two vertices of P are separated by distance at leas...
Michael O. Albertson, Douglas B. West