Studies on Interval Digraphs.

Date of Submission

December 2010

Date of Award

Winter 12-12-2011

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science

Department

Advance Computing and Microelectronics Unit (ACMU-Kolkata)

Supervisor

Das, Sandip (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

The intersection digraph of a family of ordered pairs of sets {(Sv, Tv) : v ∈ V} is the digraph D(V, E) such that uv ∈ E if and only if Su ∩ Tv 6= ∅. Interval digraph are those intersection digraphs for which the subsets are intervals on the real line. We study the characterization of interval digraphs in terms of zeros partition property Sen et.al. (1) , (2) of its adjacency matrix and in terms of ferrers digraphs in Sen et.al. (1). The important problem of characterizing interval digraphs by its forbidden subgraphs is still open. Algorithm for recognizing interval digraphs was given in Muller (3). We ¨ propose an efficient algorithm for recognizing interval digraphs based our approach to characterize the class of all interval digraph using forbidden subgraphs

Comments

ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843159

Control Number

ISI-DISS-2010-258

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/6414

This document is currently not available here.

Share

COinS