46 search results - page 9 / 10 » On plane bipartite graphs without fixed edges |
STOC
2003
ACM
14 years 6 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
CLA
2004
13 years 7 months ago
2004
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
GC
2008
Springer
13 years 5 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
CORR
2011
Springer
13 years 24 days ago
2011
Springer
In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with...
ICCSA
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...