Sciweavers

347 search results - page 15 / 70
» Schaefer's theorem for graphs
Sort
View
57
Voted
ENTCS
2002
105views more  ENTCS 2002»
14 years 9 months ago
Fixed points in digital topology (via Helly posets)
Abstract. We extend some of our previous results on fixed points of graph multifunctions to posets. The posets of most interest here are the (finite) Khalimsky spaces, in their spe...
Rueiher Tsaur, Michael B. Smyth
CORR
2011
Springer
128views Education» more  CORR 2011»
14 years 4 months ago
LIFO-search on digraphs: A searching game for cycle-rank
We consider the extension of the last-in-first-out graph searching game of Giannopoulou and Thilikos to digraphs. We show that all common variations of the game require the same ...
Paul Hunter
CIIA
2009
14 years 10 months ago
LCF-style for Secure Verification Platform based on Multiway Decision Graphs
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
Sa'ed Abed, Otmane Aït Mohamed
FOCS
2006
IEEE
15 years 3 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
GC
2007
Springer
14 years 9 months ago
An Ore-type analogue of the Sauer-Spencer Theorem
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...
Alexandr V. Kostochka, Gexin Yu