1729 search results - page 124 / 346 » Bound Graph Polysemy |
150
click to vote
TCS
2008
15 years 6 months ago
2008
Given a graph G and an integer k, two players alternatively color the edges of G using k colors so that adjacent edges get different colors. The game chromatic index g(G) is the m...
160
click to vote
CPC
2002
15 years 6 months ago
2002
Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then (G) r 2 p 1 p e (G): This inequality was ...rst conjectured by Edwards ...
189
click to vote
ICALP
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
146
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
169
click to vote
PVLDB
2010
15 years 4 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...