<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
<channel rdf:about="http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/1955">
<title>Publications</title>
<link>http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/1955</link>
<description>Publications</description>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/1962"/>
</rdf:Seq>
</items>
<dc:date>2026-04-06T22:24:43Z</dc:date>
</channel>
<item rdf:about="http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/1962">
<title>Straight-Line Monotone Grid Drawings of Series-Parallel Graphs</title>
<link>http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/1962</link>
<description>Straight-Line Monotone Grid Drawings of Series-Parallel Graphs
Md. Iqbal, Hossain; Md. Saidur, Rahman; Md. Iqbal, Hossain
A monotone drawing of a planar graph G is a planar straight-line drawing of G where&#13;
a monotone path exists between every pair of vertices of G in some direction. Recently&#13;
monotone drawings of graphs have been discovered as a new standard for visualizing&#13;
graphs. In this paper we study monotone drawings of series–parallel graphs in a variable&#13;
embedding setting. We show that a series–parallel graph of n vertices has a straight-line&#13;
planar monotone drawing on a grid of size O(n) × O(n2) and such a drawing can be&#13;
found in linear time.
</description>
<dc:date>2014-03-20T00:00:00Z</dc:date>
</item>
</rdf:RDF>
