Sciweavers

650 search results - page 22 / 130
» Positive graphs
Sort
View
99
Voted
APVIS
2006
14 years 11 months ago
Drawing bipartite graphs as anchored maps
A method of drawing anchored maps for bipartite graphs is presented. Suppose that the node set of a bipartite graph is divided into set A and set B. On an anchored map of the bipa...
Kazuo Misue
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
15 years 10 months ago
Hardness of the undirected congestion minimization problem
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...
Matthew Andrews, Lisa Zhang
ENDM
2002
74views more  ENDM 2002»
14 years 9 months ago
Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...
Wayne Goddard, Michael A. Henning
CPC
2010
74views more  CPC 2010»
14 years 7 months ago
Playing to Retain the Advantage
Let P be a monotone increasing graph property, let G = (V, E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the ed...
Noga Alon, Dan Hefetz, Michael Krivelevich
ECEASST
2010
14 years 7 months ago
Conditional Adaptive Star Grammars
Abstract. The precise specification of software models is a major concern in model-driven design of object-oriented software. In this paper, we investigate how program graphs, a la...
Berthold Hoffmann