WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Language
    অসমীয়া বাংলা भोजपुरी डोगरी English ગુજરાતી हिंदी ಕನ್ನಡ
    Khasi कोंकणी मैथिली മലയാളം ꯃꯤꯇꯩ ꯂꯣꯟ मराठी Mizo नेपाली
    ଓଡ଼ିଆ ਪੰਜਾਬੀ संस्कृत ᱥᱟᱱᱛᱟᱲᱤ सिन्धी தமிழ் తెలుగు اردو
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Mathematics in Computer Science
  2. Mathematics in Computer Science : Volume 3
  3. Mathematics in Computer Science : Volume 3, Issue 1, March 2010
  4. Loose Cover of Graphs
Loading...

Please wait, while we are loading the content...

Mathematics in Computer Science : Volume 11
Mathematics in Computer Science : Volume 10
Mathematics in Computer Science : Volume 9
Mathematics in Computer Science : Volume 8
Mathematics in Computer Science : Volume 7
Mathematics in Computer Science : Volume 6
Mathematics in Computer Science : Volume 5
Mathematics in Computer Science : Volume 4
Mathematics in Computer Science : Volume 3
Mathematics in Computer Science : Volume 3, Issue 4, June 2010
Mathematics in Computer Science : Volume 3, Issue 3, May 2010
Mathematics in Computer Science : Volume 3, Issue 2, April 2010
Mathematics in Computer Science : Volume 3, Issue 1, March 2010
Foreword
Partitioning Bispanning Graphs into Spanning Trees
Finding Range Minima in the Middle: Approximations and Applications
Loose Cover of Graphs
On Partitional Labelings of Graphs
An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations
K-Phase Oscillator Synchronization for Graph Coloring
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
On Conditional Covering Problem
On the Pagenumber of the Cube-Connected Cycles
New Results on EX Graphs
Mathematics in Computer Science : Volume 2
Mathematics in Computer Science : Volume 1

Similar Documents

...
An efficient pram algorithm for maximum-weight independent set on permutation graphs

Article

...
Kernels for (connected) Dominating Set on graphs with Excluded Topological subgraphs

Article

...
Combinatorics and Algorithms for Augmenting Graphs

Article

...
Genetic algorithmic approach to find the maximum weight independent set of a graph

Article

...
Enumerating minimal dominating sets in $K_t$-free graphs and variants

Article

...
The eternal dominating set problem for interval graphs

Article

...
Generating subgraphs in chordal graphs

Article

...
Upper clique transversals in graphs

Article

...
On the Enumeration of Minimal Dominating Sets and Related Notions

Article

Loose Cover of Graphs

Content Provider Springer Nature Link
Author Fujita, Satoshi
Copyright Year 2009
Abstract This paper introduces a new definition of embedding a local structure to a given network, called loose cover of graphs. We derive several basic properties on the notion of loose cover, which includes transitivity, maximality, and the computational complexity of finding a loose cover by paths and cycles. In particular, we show that the decision problem is in P if the given local structure is a path with three or less vertices, while it is NP-complete for paths consisting of six or more vertices.
Starting Page 31
Ending Page 38
Page Count 8
File Format PDF
ISSN 16618270
Journal Mathematics in Computer Science
Volume Number 3
Issue Number 1
e-ISSN 16618289
Language English
Publisher Birkhäuser-Verlag
Publisher Date 2009-11-27
Publisher Place Basel
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Dominating set Cover of graphs Graph embedding Graph algorithms Dominating sets, independent sets, cliques Mathematics Computer Science
Content Type Text
Resource Type Article
Subject Applied Mathematics Computational Theory and Mathematics Computational Mathematics
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
Cite this Content
Loading...