Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Research Skills
Help
EN
DE
ES
FR
My account
Logout
Change account settings
Login
Publications
Events
Your search terms
Search
Search options
All Fields
Title
Exact title
Subject
Author
Institution
ISBN/ISSN
Published in...
Publisher
Open Access only
Advanced
Search history
My EconBiz
Favorites
Loans
Reservations
Fines
You are here:
Home
Search: subject:"independent dominating set in graphs"
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
Algorithm
1
Algorithmus
1
Experiment
1
Graph theory
1
Graphentheorie
1
Heuristics
1
Heuristik
1
Mathematical programming
1
Mathematische Optimierung
1
Scheduling problem
1
Scheduling-Verfahren
1
combinatorial optimization
1
exact algorithm
1
experimentations
1
heuristics
1
independent dominating set in graphs
1
worst case analysis
1
more ...
less ...
Type of publication
All
Article
1
Type of publication (narrower categories)
All
Article in journal
1
Aufsatz in Zeitschrift
1
Language
All
English
1
Author
All
Laforest, Christian
1
Phan, Raksmey
1
Published in...
All
RAIRO / Operations research
1
Source
All
ECONIS (ZBW)
1
Showing
1
-
1
of
1
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Solving the Minimum Independent Domination Set problem in graphs by exact algorithm and greedy heuristic
Laforest, Christian
;
Phan, Raksmey
- In:
RAIRO / Operations research
47
(
2013
)
3
,
pp. 199-221
Persistent link: https://www.econbiz.de/10010492813
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
